./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_fillercode_fillercodestructure_filler-pe-ci_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2455b112e52a42d84b808fd6137571b9cca3ff5d97324027a8a2378e325a2c67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:54:34,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:54:34,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:54:34,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:54:34,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:54:34,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:54:34,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:54:34,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:54:34,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:54:34,481 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:54:34,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:54:34,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:54:34,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:54:34,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:54:34,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:54:34,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:54:34,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:54:34,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:54:34,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:54:34,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:54:34,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:54:34,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:54:34,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:54:34,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:54:34,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:54:34,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:54:34,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:54:34,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:54:34,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:54:34,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:54:34,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:54:34,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:54:34,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:54:34,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:54:34,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:54:34,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:54:34,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:54:34,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:54:34,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:54:34,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:54:34,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:54:34,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:54:34,497 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-clean/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-clean/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 -> 2455b112e52a42d84b808fd6137571b9cca3ff5d97324027a8a2378e325a2c67 [2024-10-11 08:54:34,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:54:34,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:54:34,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:54:34,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:54:34,803 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:54:34,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i [2024-10-11 08:54:36,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:54:36,559 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:54:36,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i [2024-10-11 08:54:36,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52da7690e/ab3b463fc70c42bb87268d4d134472fb/FLAGb6ce65f03 [2024-10-11 08:54:36,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52da7690e/ab3b463fc70c42bb87268d4d134472fb [2024-10-11 08:54:36,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:54:36,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:54:36,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:54:36,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:54:36,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:54:36,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:36,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a42921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36, skipping insertion in model container [2024-10-11 08:54:36,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:36,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:54:36,786 WARN L248 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_fillercode_fillercodestructure_filler-pe-ci_file-33.i[919,932] [2024-10-11 08:54:36,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:54:36,868 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:54:36,879 WARN L248 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_fillercode_fillercodestructure_filler-pe-ci_file-33.i[919,932] [2024-10-11 08:54:36,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:54:36,970 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:54:36,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36 WrapperNode [2024-10-11 08:54:36,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:54:36,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:54:36,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:54:36,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:54:36,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,058 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-11 08:54:37,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:54:37,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:54:37,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:54:37,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:54:37,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,104 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:54:37,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:54:37,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:54:37,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:54:37,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:54:37,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (1/1) ... [2024-10-11 08:54:37,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:54:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:54:37,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:54:37,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:54:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:54:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:54:37,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:54:37,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:54:37,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:54:37,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:54:37,333 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:54:37,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:54:37,783 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 08:54:37,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:54:37,837 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:54:37,837 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:54:37,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:54:37 BoogieIcfgContainer [2024-10-11 08:54:37,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:54:37,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:54:37,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:54:37,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:54:37,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:54:36" (1/3) ... [2024-10-11 08:54:37,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4581096f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:54:37, skipping insertion in model container [2024-10-11 08:54:37,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:54:36" (2/3) ... [2024-10-11 08:54:37,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4581096f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:54:37, skipping insertion in model container [2024-10-11 08:54:37,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:54:37" (3/3) ... [2024-10-11 08:54:37,850 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i [2024-10-11 08:54:37,866 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:54:37,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:54:37,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:54:37,935 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;@4aee219b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:54:37,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:54:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:54:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 08:54:37,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:54:37,956 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 08:54:37,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:54:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:54:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -690950363, now seen corresponding path program 1 times [2024-10-11 08:54:37,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:54:37,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880816741] [2024-10-11 08:54:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:54:37,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:54:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:54:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:54:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:54:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:54:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:54:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:54:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:54:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:54:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:54:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:54:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:54:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:54:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:54:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:54:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:54:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:54:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:54:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:54:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:54:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:54:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:54:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:54:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:54:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:54:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:54:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:54:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:54:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:54:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880816741] [2024-10-11 08:54:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880816741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:54:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:54:38,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:54:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528442074] [2024-10-11 08:54:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:54:38,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:54:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:54:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:54:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:54:38,601 INFO L87 Difference]: Start difference. First operand has 82 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 08:54:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:54:38,664 INFO L93 Difference]: Finished difference Result 159 states and 284 transitions. [2024-10-11 08:54:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:54:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-10-11 08:54:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:54:38,677 INFO L225 Difference]: With dead ends: 159 [2024-10-11 08:54:38,677 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 08:54:38,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-11 08:54:38,689 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:54:38,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:54:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 08:54:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 08:54:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:54:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2024-10-11 08:54:38,759 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 165 [2024-10-11 08:54:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:54:38,761 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2024-10-11 08:54:38,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 08:54:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2024-10-11 08:54:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 08:54:38,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:54:38,767 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 08:54:38,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:54:38,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:54:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:54:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1729551131, now seen corresponding path program 1 times [2024-10-11 08:54:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:54:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152366429] [2024-10-11 08:54:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:54:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:54:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:54:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:54:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:54:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:54:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:54:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:54:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:54:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:54:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:54:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:54:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:54:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:54:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:54:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:54:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:54:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:54:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:54:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:54:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:54:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:54:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:54:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:54:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:54:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:54:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:54:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:39,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:54:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:54:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:54:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152366429] [2024-10-11 08:54:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152366429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:54:40,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:54:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:54:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441897941] [2024-10-11 08:54:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:54:40,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:54:40,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:54:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:54:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:54:40,012 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:54:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:54:40,356 INFO L93 Difference]: Finished difference Result 237 states and 363 transitions. [2024-10-11 08:54:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:54:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-11 08:54:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:54:40,364 INFO L225 Difference]: With dead ends: 237 [2024-10-11 08:54:40,365 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 08:54:40,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:54:40,370 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 81 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:54:40,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 295 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:54:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 08:54:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2024-10-11 08:54:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 08:54:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2024-10-11 08:54:40,416 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 165 [2024-10-11 08:54:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:54:40,417 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2024-10-11 08:54:40,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:54:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2024-10-11 08:54:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 08:54:40,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:54:40,424 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 08:54:40,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:54:40,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:54:40,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:54:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1779688814, now seen corresponding path program 1 times [2024-10-11 08:54:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:54:40,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320842490] [2024-10-11 08:54:40,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:54:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:54:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:54:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:54:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:54:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:54:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:54:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:54:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:54:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:54:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:54:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:54:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:54:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:54:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:54:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:54:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:54:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:54:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:54:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:54:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:54:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:54:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:54:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:54:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:54:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:54:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:54:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:54:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:54:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:54:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:54:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320842490] [2024-10-11 08:54:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320842490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:54:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:54:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:54:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293536437] [2024-10-11 08:54:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:54:40,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:54:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:54:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:54:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:54:40,914 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:54:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:54:41,200 INFO L93 Difference]: Finished difference Result 255 states and 388 transitions. [2024-10-11 08:54:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:54:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 08:54:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:54:41,204 INFO L225 Difference]: With dead ends: 255 [2024-10-11 08:54:41,206 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 08:54:41,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:54:41,209 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 78 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:54:41,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 300 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:54:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 08:54:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2024-10-11 08:54:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 08:54:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 226 transitions. [2024-10-11 08:54:41,261 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 226 transitions. Word has length 166 [2024-10-11 08:54:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:54:41,262 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 226 transitions. [2024-10-11 08:54:41,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:54:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 226 transitions. [2024-10-11 08:54:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:54:41,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:54:41,268 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 08:54:41,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:54:41,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:54:41,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:54:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash -265462366, now seen corresponding path program 1 times [2024-10-11 08:54:41,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:54:41,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759985397] [2024-10-11 08:54:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:54:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:54:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat