./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-ps-ci_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_fillercode_fillercodestructure_filler-ps-ci_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 aebb37500dc668a05af62617a20988760605c85011722d37da8580f79d2f9b7f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:10:07,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:10:07,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:10:07,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:10:07,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:10:07,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:10:07,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:10:07,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:10:07,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:10:07,307 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:10:07,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:10:07,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:10:07,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:10:07,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:10:07,309 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:10:07,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:10:07,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:10:07,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:10:07,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:10:07,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:10:07,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:10:07,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:10:07,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:10:07,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:10:07,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:10:07,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:10:07,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:10:07,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:10:07,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:10:07,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:10:07,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:10:07,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:10:07,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:10:07,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:10:07,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:10:07,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:10:07,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:10:07,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:10:07,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:10:07,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:10:07,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:10:07,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:10:07,318 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 -> aebb37500dc668a05af62617a20988760605c85011722d37da8580f79d2f9b7f [2024-11-20 05:10:07,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:10:07,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:10:07,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:10:07,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:10:07,605 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:10:07,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-58.i [2024-11-20 05:10:09,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:10:09,342 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:10:09,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-58.i [2024-11-20 05:10:09,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ccff196/756e6aefac9c4c9d99535d86bb8772aa/FLAG8c7008097 [2024-11-20 05:10:09,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ccff196/756e6aefac9c4c9d99535d86bb8772aa [2024-11-20 05:10:09,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:10:09,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:10:09,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:10:09,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:10:09,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:10:09,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125b5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09, skipping insertion in model container [2024-11-20 05:10:09,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:10:09,618 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_fillercode_fillercodestructure_filler-ps-ci_file-58.i[919,932] [2024-11-20 05:10:09,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:10:09,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:10:09,713 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_fillercode_fillercodestructure_filler-ps-ci_file-58.i[919,932] [2024-11-20 05:10:09,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:10:09,768 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:10:09,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09 WrapperNode [2024-11-20 05:10:09,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:10:09,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:10:09,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:10:09,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:10:09,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,843 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2024-11-20 05:10:09,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:10:09,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:10:09,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:10:09,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:10:09,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,886 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-11-20 05:10:09,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:10:09,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:10:09,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:10:09,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:10:09,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (1/1) ... [2024-11-20 05:10:09,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:10:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:10:09,973 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 05:10:09,976 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 05:10:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:10:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:10:10,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:10:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:10:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:10:10,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:10:10,125 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:10:10,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:10:10,561 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:10:10,562 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:10:10,579 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:10:10,579 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:10:10,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:10:10 BoogieIcfgContainer [2024-11-20 05:10:10,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:10:10,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:10:10,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:10:10,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:10:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:10:09" (1/3) ... [2024-11-20 05:10:10,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3ba401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:10:10, skipping insertion in model container [2024-11-20 05:10:10,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:09" (2/3) ... [2024-11-20 05:10:10,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3ba401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:10:10, skipping insertion in model container [2024-11-20 05:10:10,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:10:10" (3/3) ... [2024-11-20 05:10:10,590 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-58.i [2024-11-20 05:10:10,609 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:10:10,609 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:10:10,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:10:10,672 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;@477c4fc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:10:10,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:10:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 64 states have (on average 1.5) internal successors, (96), 65 states have internal predecessors, (96), 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-11-20 05:10:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 05:10:10,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:10:10,693 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, 1, 1, 1, 1] [2024-11-20 05:10:10,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:10:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:10:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash -617123096, now seen corresponding path program 1 times [2024-11-20 05:10:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:10:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442795543] [2024-11-20 05:10:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:10:10,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:10:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:10:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:10:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 05:10:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:10:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:10:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:10:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:10:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:10:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:10:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:10:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:10:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:10:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 05:10:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:10:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 05:10:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:10:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:10:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:10:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 05:10:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:10:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 05:10:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:10:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:10:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:10:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 05:10:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:10:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 05:10:11,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:10:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442795543] [2024-11-20 05:10:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442795543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:10:11,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:10:11,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:10:11,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329480436] [2024-11-20 05:10:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:10:11,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:10:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:10:11,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:10:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:10:11,297 INFO L87 Difference]: Start difference. First operand has 93 states, 64 states have (on average 1.5) internal successors, (96), 65 states have internal predecessors, (96), 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-11-20 05:10:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:10:11,385 INFO L93 Difference]: Finished difference Result 179 states and 316 transitions. [2024-11-20 05:10:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:10:11,390 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, (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 171 [2024-11-20 05:10:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:10:11,400 INFO L225 Difference]: With dead ends: 179 [2024-11-20 05:10:11,400 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 05:10:11,436 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-11-20 05:10:11,444 INFO L432 NwaCegarLoop]: 138 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, 138 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 05:10:11,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:10:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 05:10:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 05:10:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 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-11-20 05:10:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2024-11-20 05:10:11,502 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 171 [2024-11-20 05:10:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:10:11,503 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-11-20 05:10:11,503 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, (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-11-20 05:10:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2024-11-20 05:10:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 05:10:11,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:10:11,507 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, 1, 1, 1, 1] [2024-11-20 05:10:11,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:10:11,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:10:11,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:10:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash -780305180, now seen corresponding path program 1 times [2024-11-20 05:10:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:10:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981802985] [2024-11-20 05:10:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:10:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:10:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:10:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:10:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 05:10:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:10:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:10:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:10:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:10:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:10:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:10:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:10:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:10:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:10:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 05:10:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:10:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 05:10:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:11,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:10:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:10:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:10:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 05:10:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:10:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 05:10:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:10:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:10:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:10:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 05:10:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:10:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 05:10:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:10:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981802985] [2024-11-20 05:10:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981802985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:10:12,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:10:12,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:10:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632272329] [2024-11-20 05:10:12,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:10:12,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:10:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:10:12,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:10:12,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:10:12,072 INFO L87 Difference]: Start difference. First operand 89 states and 138 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, (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-11-20 05:10:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:10:12,252 INFO L93 Difference]: Finished difference Result 262 states and 410 transitions. [2024-11-20 05:10:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:10:12,253 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, (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 171 [2024-11-20 05:10:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:10:12,258 INFO L225 Difference]: With dead ends: 262 [2024-11-20 05:10:12,259 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 05:10:12,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:10:12,263 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 88 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:10:12,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 375 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:10:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 05:10:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-20 05:10:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 119 states have internal predecessors, (169), 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-11-20 05:10:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 273 transitions. [2024-11-20 05:10:12,312 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 273 transitions. Word has length 171 [2024-11-20 05:10:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:10:12,313 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 273 transitions. [2024-11-20 05:10:12,314 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, (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-11-20 05:10:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 273 transitions. [2024-11-20 05:10:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 05:10:12,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:10:12,318 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, 1, 1, 1, 1, 1] [2024-11-20 05:10:12,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:10:12,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:10:12,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:10:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1208125856, now seen corresponding path program 1 times [2024-11-20 05:10:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:10:12,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483723829] [2024-11-20 05:10:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:10:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:10:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:10:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:10:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 05:10:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:10:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:10:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:10:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:10:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:10:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:10:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:10:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:10:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:10:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 05:10:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:10:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 05:10:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:10:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:10:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:10:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 05:10:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:10:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 05:10:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:10:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:10:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:10:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 05:10:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:10:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 05:10:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:10:12,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483723829] [2024-11-20 05:10:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483723829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:10:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:10:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:10:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044159887] [2024-11-20 05:10:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:10:12,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:10:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:10:12,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:10:12,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:10:12,805 INFO L87 Difference]: Start difference. First operand 174 states and 273 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 05:10:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:10:13,019 INFO L93 Difference]: Finished difference Result 347 states and 544 transitions. [2024-11-20 05:10:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:10:13,019 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), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-20 05:10:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:10:13,024 INFO L225 Difference]: With dead ends: 347 [2024-11-20 05:10:13,025 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 05:10:13,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:10:13,030 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 126 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:10:13,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 495 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:10:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 05:10:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-20 05:10:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.411764705882353) internal successors, (168), 119 states have internal predecessors, (168), 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-11-20 05:10:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 272 transitions. [2024-11-20 05:10:13,059 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 272 transitions. Word has length 172 [2024-11-20 05:10:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:10:13,060 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 272 transitions. [2024-11-20 05:10:13,060 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), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 05:10:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 272 transitions. [2024-11-20 05:10:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 05:10:13,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:10:13,067 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, 1, 1, 1, 1, 1] [2024-11-20 05:10:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:10:13,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:10:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:10:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1630827682, now seen corresponding path program 1 times [2024-11-20 05:10:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:10:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144241395] [2024-11-20 05:10:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:10:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:10:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat