./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47d9c6f35709a52125d621eba0ec18ad6da014805bad20f4d26ed2a4fcb7a8f5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:58:48,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:58:48,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:58:48,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:58:48,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:58:48,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:58:48,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:58:48,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:58:48,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:58:48,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:58:48,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:58:48,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:58:48,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:58:48,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:58:48,858 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:58:48,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:58:48,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:58:48,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:58:48,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:58:48,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:58:48,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:58:48,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:58:48,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:58:48,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:58:48,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:58:48,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:58:48,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:58:48,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:58:48,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:58:48,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:58:48,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:58:48,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:58:48,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:58:48,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:58:48,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:58:48,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:58:48,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:58:48,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:58:48,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:58:48,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:58:48,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:58:48,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:58:48,867 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47d9c6f35709a52125d621eba0ec18ad6da014805bad20f4d26ed2a4fcb7a8f5 [2024-11-20 08:58:49,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:58:49,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:58:49,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:58:49,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:58:49,162 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:58:49,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i [2024-11-20 08:58:50,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:58:50,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:58:50,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i [2024-11-20 08:58:50,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c705fa1/a82577b6778e4796b04a2d738065225a/FLAGa619157db [2024-11-20 08:58:50,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c705fa1/a82577b6778e4796b04a2d738065225a [2024-11-20 08:58:50,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:58:50,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:58:50,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:58:50,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:58:50,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:58:50,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:58:50" (1/1) ... [2024-11-20 08:58:50,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58001b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:50, skipping insertion in model container [2024-11-20 08:58:50,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:58:50" (1/1) ... [2024-11-20 08:58:50,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:58:51,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i[916,929] [2024-11-20 08:58:51,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:58:51,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:58:51,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i[916,929] [2024-11-20 08:58:51,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:58:51,178 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:58:51,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51 WrapperNode [2024-11-20 08:58:51,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:58:51,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:58:51,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:58:51,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:58:51,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,243 INFO L138 Inliner]: procedures = 27, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2024-11-20 08:58:51,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:58:51,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:58:51,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:58:51,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:58:51,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,291 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-20 08:58:51,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:58:51,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:58:51,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:58:51,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:58:51,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (1/1) ... [2024-11-20 08:58:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:58:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:58:51,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:58:51,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:58:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:58:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-20 08:58:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-20 08:58:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:58:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:58:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:58:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:58:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:58:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:58:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:58:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:58:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:58:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:58:51,523 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:58:51,525 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:58:52,078 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-20 08:58:52,078 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:58:52,096 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:58:52,097 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:58:52,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:58:52 BoogieIcfgContainer [2024-11-20 08:58:52,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:58:52,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:58:52,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:58:52,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:58:52,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:58:50" (1/3) ... [2024-11-20 08:58:52,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2784ed43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:58:52, skipping insertion in model container [2024-11-20 08:58:52,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:58:51" (2/3) ... [2024-11-20 08:58:52,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2784ed43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:58:52, skipping insertion in model container [2024-11-20 08:58:52,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:58:52" (3/3) ... [2024-11-20 08:58:52,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-58.i [2024-11-20 08:58:52,125 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:58:52,125 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:58:52,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:58:52,196 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dd97fad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:58:52,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:58:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 75 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:58:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 08:58:52,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:58:52,214 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:58:52,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:58:52,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:58:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -773362153, now seen corresponding path program 1 times [2024-11-20 08:58:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:58:52,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022887205] [2024-11-20 08:58:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:58:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:58:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:58:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:58:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:58:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:58:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:58:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:58:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:58:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:58:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:58:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:58:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:58:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:58:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:58:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:58:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:58:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:58:52,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:58:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022887205] [2024-11-20 08:58:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022887205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:58:52,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:58:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:58:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952128798] [2024-11-20 08:58:52,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:58:52,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:58:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:58:52,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:58:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:58:52,696 INFO L87 Difference]: Start difference. First operand has 92 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 75 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:58:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:58:52,729 INFO L93 Difference]: Finished difference Result 173 states and 269 transitions. [2024-11-20 08:58:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:58:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-20 08:58:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:58:52,738 INFO L225 Difference]: With dead ends: 173 [2024-11-20 08:58:52,738 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 08:58:52,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:58:52,746 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:58:52,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:58:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 08:58:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-20 08:58:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:58:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-20 08:58:52,799 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 116 [2024-11-20 08:58:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:58:52,800 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-20 08:58:52,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:58:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-20 08:58:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 08:58:52,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:58:52,804 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:58:52,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:58:52,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:58:52,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:58:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1258197323, now seen corresponding path program 1 times [2024-11-20 08:58:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:58:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940771151] [2024-11-20 08:58:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:58:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:58:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:58:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:58:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:58:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:58:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:58:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:58:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:58:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:58:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:58:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:58:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:58:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:58:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:58:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:58:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:58:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:58:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:58:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940771151] [2024-11-20 08:58:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940771151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:58:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:58:53,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:58:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120190400] [2024-11-20 08:58:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:58:53,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:58:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:58:53,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:58:53,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:58:53,257 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:58:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:58:53,312 INFO L93 Difference]: Finished difference Result 168 states and 237 transitions. [2024-11-20 08:58:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:58:53,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-11-20 08:58:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:58:53,315 INFO L225 Difference]: With dead ends: 168 [2024-11-20 08:58:53,315 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 08:58:53,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:58:53,320 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:58:53,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:58:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 08:58:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-20 08:58:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:58:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2024-11-20 08:58:53,337 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 116 [2024-11-20 08:58:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:58:53,341 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-11-20 08:58:53,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:58:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-11-20 08:58:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 08:58:53,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:58:53,344 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:58:53,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:58:53,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:58:53,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:58:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1256350281, now seen corresponding path program 1 times [2024-11-20 08:58:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:58:53,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118876248] [2024-11-20 08:58:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:58:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:58:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:58:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:58:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:58:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:58:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:58:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:58:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:58:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:58:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:58:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:58:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:58:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:58:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:58:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:58:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:58:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:58:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:58:54,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118876248] [2024-11-20 08:58:54,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118876248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:58:54,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:58:54,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:58:54,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935658953] [2024-11-20 08:58:54,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:58:54,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:58:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:58:54,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:58:54,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:58:54,324 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:58:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:58:54,796 INFO L93 Difference]: Finished difference Result 249 states and 349 transitions. [2024-11-20 08:58:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:58:54,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-11-20 08:58:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:58:54,799 INFO L225 Difference]: With dead ends: 249 [2024-11-20 08:58:54,801 INFO L226 Difference]: Without dead ends: 166 [2024-11-20 08:58:54,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:58:54,804 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 94 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:58:54,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 365 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:58:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-20 08:58:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-11-20 08:58:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 131 states have (on average 1.297709923664122) internal successors, (170), 131 states have internal predecessors, (170), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:58:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 230 transitions. [2024-11-20 08:58:54,836 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 230 transitions. Word has length 116 [2024-11-20 08:58:54,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:58:54,836 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 230 transitions. [2024-11-20 08:58:54,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:58:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 230 transitions. [2024-11-20 08:58:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 08:58:54,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:58:54,838 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:58:54,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:58:54,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:58:54,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:58:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1727925920, now seen corresponding path program 1 times [2024-11-20 08:58:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:58:54,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888735938] [2024-11-20 08:58:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:58:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:58:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:58:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:58:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:58:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:58:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:58:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:58:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:58:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:58:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:58:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:58:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:58:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:58:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:58:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:58:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:58:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:58:56,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:58:56,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888735938] [2024-11-20 08:58:56,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888735938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:58:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:58:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:58:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083913651] [2024-11-20 08:58:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:58:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:58:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:58:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:58:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:58:56,492 INFO L87 Difference]: Start difference. First operand 164 states and 230 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:58:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:58:56,854 INFO L93 Difference]: Finished difference Result 368 states and 515 transitions. [2024-11-20 08:58:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:58:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-20 08:58:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:58:56,857 INFO L225 Difference]: With dead ends: 368 [2024-11-20 08:58:56,857 INFO L226 Difference]: Without dead ends: 207 [2024-11-20 08:58:56,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:58:56,859 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:58:56,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 704 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:58:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-20 08:58:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 178. [2024-11-20 08:58:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:58:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 249 transitions. [2024-11-20 08:58:56,890 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 249 transitions. Word has length 116 [2024-11-20 08:58:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:58:56,891 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 249 transitions. [2024-11-20 08:58:56,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:58:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 249 transitions. [2024-11-20 08:58:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 08:58:56,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:58:56,896 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:58:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:58:56,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:58:56,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:58:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1469760482, now seen corresponding path program 1 times [2024-11-20 08:58:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:58:56,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261019482] [2024-11-20 08:58:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:58:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:58:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:58:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:58:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:58:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:58:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:58:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:58:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:58:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:58:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:58:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:58:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:58:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:58:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:58:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:58:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:58:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:58:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:58:58,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:58:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261019482] [2024-11-20 08:58:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261019482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:58:58,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:58:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:58:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962741884] [2024-11-20 08:58:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:58:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:58:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:58:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:58:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:58:58,706 INFO L87 Difference]: Start difference. First operand 178 states and 249 transitions. Second operand has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-20 08:58:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:58:59,380 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2024-11-20 08:58:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:58:59,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2024-11-20 08:58:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:58:59,384 INFO L225 Difference]: With dead ends: 406 [2024-11-20 08:58:59,384 INFO L226 Difference]: Without dead ends: 231 [2024-11-20 08:58:59,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:58:59,385 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:58:59,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 548 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:58:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-20 08:58:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 218. [2024-11-20 08:58:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 181 states have internal predecessors, (231), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 08:58:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 299 transitions. [2024-11-20 08:58:59,411 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 299 transitions. Word has length 116 [2024-11-20 08:58:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:58:59,412 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 299 transitions. [2024-11-20 08:58:59,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-20 08:58:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 299 transitions. [2024-11-20 08:58:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 08:58:59,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:58:59,414 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:58:59,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:58:59,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:58:59,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:58:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 978693474, now seen corresponding path program 1 times [2024-11-20 08:58:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:58:59,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412160406] [2024-11-20 08:58:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:58:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:58:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412160406] [2024-11-20 08:59:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412160406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:00,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:59:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436902723] [2024-11-20 08:59:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:59:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:59:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:59:00,872 INFO L87 Difference]: Start difference. First operand 218 states and 299 transitions. Second operand has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-20 08:59:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:01,631 INFO L93 Difference]: Finished difference Result 472 states and 648 transitions. [2024-11-20 08:59:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:59:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2024-11-20 08:59:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:01,636 INFO L225 Difference]: With dead ends: 472 [2024-11-20 08:59:01,636 INFO L226 Difference]: Without dead ends: 266 [2024-11-20 08:59:01,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:59:01,638 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 66 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:01,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 626 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:59:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-20 08:59:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 232. [2024-11-20 08:59:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 193 states have (on average 1.2953367875647668) internal successors, (250), 195 states have internal predecessors, (250), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 08:59:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 318 transitions. [2024-11-20 08:59:01,666 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 318 transitions. Word has length 116 [2024-11-20 08:59:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:01,666 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 318 transitions. [2024-11-20 08:59:01,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-20 08:59:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 318 transitions. [2024-11-20 08:59:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 08:59:01,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:01,669 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:01,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:59:01,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:01,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1236858912, now seen corresponding path program 1 times [2024-11-20 08:59:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:01,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733348608] [2024-11-20 08:59:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733348608] [2024-11-20 08:59:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733348608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:59:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217076031] [2024-11-20 08:59:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:02,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:59:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:59:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:59:02,723 INFO L87 Difference]: Start difference. First operand 232 states and 318 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:03,327 INFO L93 Difference]: Finished difference Result 498 states and 681 transitions. [2024-11-20 08:59:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:59:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-20 08:59:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:03,330 INFO L225 Difference]: With dead ends: 498 [2024-11-20 08:59:03,330 INFO L226 Difference]: Without dead ends: 278 [2024-11-20 08:59:03,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:59:03,332 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 61 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:03,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1158 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:59:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-20 08:59:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 275. [2024-11-20 08:59:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 228 states have (on average 1.2850877192982457) internal successors, (293), 231 states have internal predecessors, (293), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 08:59:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 373 transitions. [2024-11-20 08:59:03,361 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 373 transitions. Word has length 116 [2024-11-20 08:59:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:03,362 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 373 transitions. [2024-11-20 08:59:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 373 transitions. [2024-11-20 08:59:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 08:59:03,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:03,363 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:03,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:59:03,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:03,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1225741899, now seen corresponding path program 1 times [2024-11-20 08:59:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744958321] [2024-11-20 08:59:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:04,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744958321] [2024-11-20 08:59:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744958321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:04,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:59:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261375993] [2024-11-20 08:59:04,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:04,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:59:04,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:04,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:59:04,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:59:04,373 INFO L87 Difference]: Start difference. First operand 275 states and 373 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:04,863 INFO L93 Difference]: Finished difference Result 623 states and 850 transitions. [2024-11-20 08:59:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:59:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-11-20 08:59:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:04,866 INFO L225 Difference]: With dead ends: 623 [2024-11-20 08:59:04,866 INFO L226 Difference]: Without dead ends: 360 [2024-11-20 08:59:04,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:59:04,868 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 51 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:04,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 608 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:59:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-20 08:59:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 290. [2024-11-20 08:59:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 243 states have (on average 1.2921810699588476) internal successors, (314), 246 states have internal predecessors, (314), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 08:59:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 394 transitions. [2024-11-20 08:59:04,894 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 394 transitions. Word has length 117 [2024-11-20 08:59:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:04,894 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 394 transitions. [2024-11-20 08:59:04,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 394 transitions. [2024-11-20 08:59:04,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 08:59:04,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:04,896 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:04,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:59:04,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash -967576461, now seen corresponding path program 1 times [2024-11-20 08:59:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895456179] [2024-11-20 08:59:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895456179] [2024-11-20 08:59:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895456179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:59:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937486890] [2024-11-20 08:59:06,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:06,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:59:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:59:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:59:06,048 INFO L87 Difference]: Start difference. First operand 290 states and 394 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:59:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:06,447 INFO L93 Difference]: Finished difference Result 637 states and 869 transitions. [2024-11-20 08:59:06,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:59:06,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2024-11-20 08:59:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:06,450 INFO L225 Difference]: With dead ends: 637 [2024-11-20 08:59:06,450 INFO L226 Difference]: Without dead ends: 359 [2024-11-20 08:59:06,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:59:06,452 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 51 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:06,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 472 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:59:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-20 08:59:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 290. [2024-11-20 08:59:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 243 states have (on average 1.2880658436213992) internal successors, (313), 246 states have internal predecessors, (313), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 08:59:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 393 transitions. [2024-11-20 08:59:06,475 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 393 transitions. Word has length 117 [2024-11-20 08:59:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:06,476 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 393 transitions. [2024-11-20 08:59:06,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:59:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 393 transitions. [2024-11-20 08:59:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 08:59:06,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:06,477 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:06,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:59:06,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1697317538, now seen corresponding path program 1 times [2024-11-20 08:59:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:06,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024585054] [2024-11-20 08:59:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:06,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024585054] [2024-11-20 08:59:06,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024585054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:06,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:06,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:59:06,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406104591] [2024-11-20 08:59:06,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:06,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:59:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:06,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:59:06,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:59:06,928 INFO L87 Difference]: Start difference. First operand 290 states and 393 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:59:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:07,286 INFO L93 Difference]: Finished difference Result 560 states and 760 transitions. [2024-11-20 08:59:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:59:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-11-20 08:59:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:07,289 INFO L225 Difference]: With dead ends: 560 [2024-11-20 08:59:07,289 INFO L226 Difference]: Without dead ends: 249 [2024-11-20 08:59:07,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:59:07,291 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 95 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:07,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 283 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:59:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-20 08:59:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2024-11-20 08:59:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 202 states have (on average 1.2475247524752475) internal successors, (252), 204 states have internal predecessors, (252), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 08:59:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 328 transitions. [2024-11-20 08:59:07,317 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 328 transitions. Word has length 117 [2024-11-20 08:59:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:07,318 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 328 transitions. [2024-11-20 08:59:07,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:59:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 328 transitions. [2024-11-20 08:59:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 08:59:07,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:07,319 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:07,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:59:07,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:07,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1075080691, now seen corresponding path program 1 times [2024-11-20 08:59:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:07,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447434817] [2024-11-20 08:59:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:08,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447434817] [2024-11-20 08:59:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447434817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:08,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:59:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987807887] [2024-11-20 08:59:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:08,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:59:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:59:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:59:08,452 INFO L87 Difference]: Start difference. First operand 247 states and 328 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:59:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:08,847 INFO L93 Difference]: Finished difference Result 508 states and 677 transitions. [2024-11-20 08:59:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:59:08,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2024-11-20 08:59:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:08,850 INFO L225 Difference]: With dead ends: 508 [2024-11-20 08:59:08,850 INFO L226 Difference]: Without dead ends: 273 [2024-11-20 08:59:08,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:59:08,851 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 45 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:08,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 483 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:59:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-20 08:59:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2024-11-20 08:59:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 204 states have internal predecessors, (251), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 08:59:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 327 transitions. [2024-11-20 08:59:08,878 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 327 transitions. Word has length 117 [2024-11-20 08:59:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:08,881 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 327 transitions. [2024-11-20 08:59:08,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:59:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 327 transitions. [2024-11-20 08:59:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 08:59:08,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:08,883 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:08,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:59:08,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:08,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1333246129, now seen corresponding path program 1 times [2024-11-20 08:59:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:08,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120472198] [2024-11-20 08:59:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:09,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:09,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120472198] [2024-11-20 08:59:09,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120472198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:09,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:09,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 08:59:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520852802] [2024-11-20 08:59:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:09,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 08:59:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:09,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 08:59:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:59:09,853 INFO L87 Difference]: Start difference. First operand 247 states and 327 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:10,481 INFO L93 Difference]: Finished difference Result 516 states and 684 transitions. [2024-11-20 08:59:10,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:59:10,482 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-11-20 08:59:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:10,484 INFO L225 Difference]: With dead ends: 516 [2024-11-20 08:59:10,484 INFO L226 Difference]: Without dead ends: 281 [2024-11-20 08:59:10,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:59:10,486 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 52 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:10,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1291 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:59:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-20 08:59:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 269. [2024-11-20 08:59:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 08:59:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 357 transitions. [2024-11-20 08:59:10,511 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 357 transitions. Word has length 117 [2024-11-20 08:59:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:10,512 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 357 transitions. [2024-11-20 08:59:10,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 357 transitions. [2024-11-20 08:59:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 08:59:10,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:10,515 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:10,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:59:10,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:10,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1245925263, now seen corresponding path program 1 times [2024-11-20 08:59:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:10,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391072955] [2024-11-20 08:59:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391072955] [2024-11-20 08:59:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391072955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:11,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:11,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:59:11,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442314263] [2024-11-20 08:59:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:11,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:59:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:59:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:59:11,658 INFO L87 Difference]: Start difference. First operand 269 states and 357 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:12,099 INFO L93 Difference]: Finished difference Result 700 states and 919 transitions. [2024-11-20 08:59:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:59:12,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 118 [2024-11-20 08:59:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:12,102 INFO L225 Difference]: With dead ends: 700 [2024-11-20 08:59:12,102 INFO L226 Difference]: Without dead ends: 434 [2024-11-20 08:59:12,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:59:12,104 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 47 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:12,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 920 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:59:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-20 08:59:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 302. [2024-11-20 08:59:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 257 states have (on average 1.2334630350194553) internal successors, (317), 259 states have internal predecessors, (317), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 08:59:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 393 transitions. [2024-11-20 08:59:12,128 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 393 transitions. Word has length 118 [2024-11-20 08:59:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:12,128 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 393 transitions. [2024-11-20 08:59:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 393 transitions. [2024-11-20 08:59:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:59:12,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:12,131 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:12,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:59:12,131 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:12,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1144824846, now seen corresponding path program 1 times [2024-11-20 08:59:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385744411] [2024-11-20 08:59:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385744411] [2024-11-20 08:59:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385744411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:15,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:15,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 08:59:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744681389] [2024-11-20 08:59:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:15,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 08:59:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:15,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 08:59:15,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:59:15,223 INFO L87 Difference]: Start difference. First operand 302 states and 393 transitions. Second operand has 14 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-20 08:59:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:18,728 INFO L93 Difference]: Finished difference Result 667 states and 865 transitions. [2024-11-20 08:59:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 08:59:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2024-11-20 08:59:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:18,732 INFO L225 Difference]: With dead ends: 667 [2024-11-20 08:59:18,732 INFO L226 Difference]: Without dead ends: 368 [2024-11-20 08:59:18,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:59:18,734 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 128 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:18,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1108 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-20 08:59:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-20 08:59:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 302. [2024-11-20 08:59:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 257 states have (on average 1.2256809338521402) internal successors, (315), 259 states have internal predecessors, (315), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 08:59:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 391 transitions. [2024-11-20 08:59:18,776 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 391 transitions. Word has length 119 [2024-11-20 08:59:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:18,777 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 391 transitions. [2024-11-20 08:59:18,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-20 08:59:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 391 transitions. [2024-11-20 08:59:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 08:59:18,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:18,779 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:18,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:59:18,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:18,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash -612352598, now seen corresponding path program 1 times [2024-11-20 08:59:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:18,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757852015] [2024-11-20 08:59:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:19,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757852015] [2024-11-20 08:59:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757852015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:19,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:19,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:59:19,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556286679] [2024-11-20 08:59:19,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:19,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:59:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:19,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:59:19,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:59:19,799 INFO L87 Difference]: Start difference. First operand 302 states and 391 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:20,254 INFO L93 Difference]: Finished difference Result 342 states and 437 transitions. [2024-11-20 08:59:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:59:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2024-11-20 08:59:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:20,257 INFO L225 Difference]: With dead ends: 342 [2024-11-20 08:59:20,257 INFO L226 Difference]: Without dead ends: 340 [2024-11-20 08:59:20,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:59:20,257 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 61 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:20,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 472 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:59:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-20 08:59:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 283. [2024-11-20 08:59:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 237 states have (on average 1.2067510548523206) internal successors, (286), 239 states have internal predecessors, (286), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 08:59:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 362 transitions. [2024-11-20 08:59:20,288 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 362 transitions. Word has length 120 [2024-11-20 08:59:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:20,289 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 362 transitions. [2024-11-20 08:59:20,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 362 transitions. [2024-11-20 08:59:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 08:59:20,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:20,291 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:20,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:59:20,291 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:20,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -610505556, now seen corresponding path program 1 times [2024-11-20 08:59:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:20,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495759627] [2024-11-20 08:59:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:21,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495759627] [2024-11-20 08:59:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495759627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:21,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:21,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:59:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747163202] [2024-11-20 08:59:21,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:21,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:59:21,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:21,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:59:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:59:21,870 INFO L87 Difference]: Start difference. First operand 283 states and 362 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:22,666 INFO L93 Difference]: Finished difference Result 723 states and 923 transitions. [2024-11-20 08:59:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 08:59:22,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2024-11-20 08:59:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:22,670 INFO L225 Difference]: With dead ends: 723 [2024-11-20 08:59:22,670 INFO L226 Difference]: Without dead ends: 460 [2024-11-20 08:59:22,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:59:22,672 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 77 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:22,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 730 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:59:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-20 08:59:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 414. [2024-11-20 08:59:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 368 states have (on average 1.2418478260869565) internal successors, (457), 370 states have internal predecessors, (457), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 08:59:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 533 transitions. [2024-11-20 08:59:22,711 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 533 transitions. Word has length 120 [2024-11-20 08:59:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:22,711 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 533 transitions. [2024-11-20 08:59:22,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 533 transitions. [2024-11-20 08:59:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 08:59:22,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:22,713 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:22,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 08:59:22,713 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:22,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1905927733, now seen corresponding path program 1 times [2024-11-20 08:59:22,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:22,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526487723] [2024-11-20 08:59:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 08:59:24,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:24,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526487723] [2024-11-20 08:59:24,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526487723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:59:24,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560954562] [2024-11-20 08:59:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:24,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:59:24,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:59:24,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:59:24,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:59:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:25,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-20 08:59:25,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:59:25,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-20 08:59:25,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:25,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-20 08:59:25,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:25,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-20 08:59:26,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:26,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 47 [2024-11-20 08:59:26,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:26,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 47 [2024-11-20 08:59:26,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:26,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 78 [2024-11-20 08:59:26,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 99 [2024-11-20 08:59:26,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:26,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 102 [2024-11-20 08:59:27,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:27,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 144 treesize of output 119 [2024-11-20 08:59:30,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:30,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 172 treesize of output 64 [2024-11-20 08:59:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 252 proven. 93 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-20 08:59:31,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:59:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560954562] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:59:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:59:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15, 26] total 40 [2024-11-20 08:59:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004909866] [2024-11-20 08:59:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:31,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:59:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:31,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:59:31,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2024-11-20 08:59:31,769 INFO L87 Difference]: Start difference. First operand 414 states and 533 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:59:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:32,596 INFO L93 Difference]: Finished difference Result 914 states and 1174 transitions. [2024-11-20 08:59:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:59:32,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-11-20 08:59:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:32,600 INFO L225 Difference]: With dead ends: 914 [2024-11-20 08:59:32,600 INFO L226 Difference]: Without dead ends: 520 [2024-11-20 08:59:32,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=238, Invalid=1484, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 08:59:32,602 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 142 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:32,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 486 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:59:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-20 08:59:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 362. [2024-11-20 08:59:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 318 states have (on average 1.2232704402515724) internal successors, (389), 319 states have internal predecessors, (389), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:59:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 461 transitions. [2024-11-20 08:59:32,635 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 461 transitions. Word has length 120 [2024-11-20 08:59:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:32,636 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 461 transitions. [2024-11-20 08:59:32,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:59:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 461 transitions. [2024-11-20 08:59:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 08:59:32,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:32,637 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:32,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:59:32,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 08:59:32,839 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:32,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1369365620, now seen corresponding path program 1 times [2024-11-20 08:59:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827099791] [2024-11-20 08:59:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 08:59:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:46,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827099791] [2024-11-20 08:59:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827099791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:59:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428033604] [2024-11-20 08:59:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:46,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:59:46,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:59:46,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:59:46,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 08:59:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:46,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-20 08:59:46,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:59:46,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 08:59:46,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 08:59:47,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-20 08:59:47,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:47,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 37 [2024-11-20 08:59:47,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:47,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 37 [2024-11-20 08:59:48,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:48,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 48 [2024-11-20 08:59:48,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:48,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 48 [2024-11-20 08:59:48,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:48,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 71 [2024-11-20 08:59:48,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:48,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 88 [2024-11-20 08:59:48,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:48,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 94 treesize of output 98 [2024-11-20 08:59:49,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:49,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 136 treesize of output 116 [2024-11-20 08:59:54,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:59:54,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 158 treesize of output 70 [2024-11-20 08:59:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 250 proven. 99 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-20 08:59:54,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:59:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428033604] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:59:56,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:59:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [22, 27] total 52 [2024-11-20 08:59:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967141230] [2024-11-20 08:59:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:56,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:59:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:59:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2393, Unknown=2, NotChecked=0, Total=2652 [2024-11-20 08:59:56,039 INFO L87 Difference]: Start difference. First operand 362 states and 461 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:59:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:56,748 INFO L93 Difference]: Finished difference Result 782 states and 993 transitions. [2024-11-20 08:59:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:59:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-20 08:59:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:56,751 INFO L225 Difference]: With dead ends: 782 [2024-11-20 08:59:56,751 INFO L226 Difference]: Without dead ends: 440 [2024-11-20 08:59:56,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=275, Invalid=2585, Unknown=2, NotChecked=0, Total=2862 [2024-11-20 08:59:56,753 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 98 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:56,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 402 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:59:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-20 08:59:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 362. [2024-11-20 08:59:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 318 states have (on average 1.2169811320754718) internal successors, (387), 319 states have internal predecessors, (387), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:59:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 459 transitions. [2024-11-20 08:59:56,787 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 459 transitions. Word has length 121 [2024-11-20 08:59:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:56,788 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 459 transitions. [2024-11-20 08:59:56,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:59:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 459 transitions. [2024-11-20 08:59:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 08:59:56,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:56,790 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:56,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 08:59:56,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 08:59:56,993 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:56,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2139255677, now seen corresponding path program 1 times [2024-11-20 08:59:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968277239] [2024-11-20 08:59:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968277239] [2024-11-20 08:59:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968277239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:57,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:57,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:59:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535499437] [2024-11-20 08:59:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:59:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:59:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:59:57,805 INFO L87 Difference]: Start difference. First operand 362 states and 459 transitions. Second operand has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:59:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:58,267 INFO L93 Difference]: Finished difference Result 728 states and 916 transitions. [2024-11-20 08:59:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:59:58,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2024-11-20 08:59:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:58,270 INFO L225 Difference]: With dead ends: 728 [2024-11-20 08:59:58,270 INFO L226 Difference]: Without dead ends: 386 [2024-11-20 08:59:58,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:59:58,272 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 42 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:58,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 629 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:59:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-20 08:59:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 356. [2024-11-20 08:59:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 312 states have (on average 1.2083333333333333) internal successors, (377), 313 states have internal predecessors, (377), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:59:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 449 transitions. [2024-11-20 08:59:58,304 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 449 transitions. Word has length 121 [2024-11-20 08:59:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:58,305 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 449 transitions. [2024-11-20 08:59:58,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:59:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 449 transitions. [2024-11-20 08:59:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 08:59:58,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:58,307 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:58,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 08:59:58,307 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:58,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash -258917269, now seen corresponding path program 1 times [2024-11-20 08:59:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:58,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56790020] [2024-11-20 08:59:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:59:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:59:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:59:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:59:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:59:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:59:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:59:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:59:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:59:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:59:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:59:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:59:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:59:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:59:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:59:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:59:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:59:59,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:59:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56790020] [2024-11-20 08:59:59,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56790020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:59:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:59:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:59:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526948052] [2024-11-20 08:59:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:59:59,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:59:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:59:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:59:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:59:59,040 INFO L87 Difference]: Start difference. First operand 356 states and 449 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:59:59,410 INFO L93 Difference]: Finished difference Result 866 states and 1082 transitions. [2024-11-20 08:59:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:59:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-11-20 08:59:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:59:59,414 INFO L225 Difference]: With dead ends: 866 [2024-11-20 08:59:59,414 INFO L226 Difference]: Without dead ends: 530 [2024-11-20 08:59:59,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:59:59,417 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:59:59,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 794 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:59:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-20 08:59:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 408. [2024-11-20 08:59:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 364 states have (on average 1.2005494505494505) internal successors, (437), 365 states have internal predecessors, (437), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:59:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 509 transitions. [2024-11-20 08:59:59,458 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 509 transitions. Word has length 122 [2024-11-20 08:59:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:59:59,459 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 509 transitions. [2024-11-20 08:59:59,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:59:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 509 transitions. [2024-11-20 08:59:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 08:59:59,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:59:59,461 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:59:59,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 08:59:59,462 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:59:59,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:59:59,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1578018729, now seen corresponding path program 1 times [2024-11-20 08:59:59,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:59:59,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224405819] [2024-11-20 08:59:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:59:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:59:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat