./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_fillercodesize_normal_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercodesize_normal_file-64.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 71592c21a828683409fd35e3c804ae28adae470b26e65a289a52fb5caf24a9a0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:54:53,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:54:53,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:54:53,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:54:53,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:54:53,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:54:53,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:54:53,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:54:53,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:54:53,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:54:53,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:54:53,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:54:53,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:54:53,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:54:53,414 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:54:53,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:54:53,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:54:53,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:54:53,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:54:53,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:54:53,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:54:53,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:54:53,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:54:53,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:54:53,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:54:53,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:54:53,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:54:53,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:54:53,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:54:53,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:54:53,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:54:53,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:54:53,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:54:53,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:54:53,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:54:53,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:54:53,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:54:53,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:54:53,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:54:53,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:54:53,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:54:53,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:54:53,422 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 -> 71592c21a828683409fd35e3c804ae28adae470b26e65a289a52fb5caf24a9a0 [2024-10-14 07:54:53,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:54:53,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:54:53,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:54:53,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:54:53,647 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:54:53,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.i [2024-10-14 07:54:54,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:54:55,087 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:54:55,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.i [2024-10-14 07:54:55,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96b04cb6/8188c5e382fc42ebbc686c457f4e1e74/FLAG43abd4d78 [2024-10-14 07:54:55,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96b04cb6/8188c5e382fc42ebbc686c457f4e1e74 [2024-10-14 07:54:55,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:54:55,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:54:55,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:54:55,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:54:55,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:54:55,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b842030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55, skipping insertion in model container [2024-10-14 07:54:55,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:54:55,247 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_fillercodesize_normal_file-64.i[913,926] [2024-10-14 07:54:55,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:54:55,299 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:54:55,308 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_fillercodesize_normal_file-64.i[913,926] [2024-10-14 07:54:55,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:54:55,351 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:54:55,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55 WrapperNode [2024-10-14 07:54:55,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:54:55,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:54:55,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:54:55,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:54:55,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,386 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-14 07:54:55,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:54:55,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:54:55,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:54:55,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:54:55,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,427 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-14 07:54:55,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:54:55,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:54:55,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:54:55,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:54:55,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (1/1) ... [2024-10-14 07:54:55,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:54:55,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:54:55,471 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-10-14 07:54:55,473 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-10-14 07:54:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:54:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:54:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:54:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:54:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:54:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:54:55,565 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:54:55,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:54:55,792 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 07:54:55,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:54:55,833 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:54:55,833 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:54:55,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:54:55 BoogieIcfgContainer [2024-10-14 07:54:55,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:54:55,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:54:55,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:54:55,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:54:55,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:54:55" (1/3) ... [2024-10-14 07:54:55,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260488cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:54:55, skipping insertion in model container [2024-10-14 07:54:55,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:54:55" (2/3) ... [2024-10-14 07:54:55,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260488cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:54:55, skipping insertion in model container [2024-10-14 07:54:55,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:54:55" (3/3) ... [2024-10-14 07:54:55,844 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-64.i [2024-10-14 07:54:55,859 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:54:55,859 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:54:55,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:54:55,911 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;@4c06d686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:54:55,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:54:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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-14 07:54:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:54:55,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:54:55,930 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] [2024-10-14 07:54:55,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:54:55,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:54:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1441737009, now seen corresponding path program 1 times [2024-10-14 07:54:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:54:55,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976885601] [2024-10-14 07:54:55,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:54:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:54:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:54:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:54:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:54:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:54:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:54:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:54:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:54:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:54:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:54:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:54:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:54:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:54:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:54:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:54:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:54:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:54:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:54:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:54:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:54:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:54:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:54:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:54:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:54:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:54:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:54:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:54:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,374 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-14 07:54:56,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:54:56,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976885601] [2024-10-14 07:54:56,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976885601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:54:56,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:54:56,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:54:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824722811] [2024-10-14 07:54:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:54:56,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:54:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:54:56,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:54:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:54:56,407 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-14 07:54:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:54:56,435 INFO L93 Difference]: Finished difference Result 135 states and 242 transitions. [2024-10-14 07:54:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:54:56,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 159 [2024-10-14 07:54:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:54:56,444 INFO L225 Difference]: With dead ends: 135 [2024-10-14 07:54:56,445 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 07:54:56,449 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-14 07:54:56,451 INFO L432 NwaCegarLoop]: 101 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, 101 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-14 07:54:56,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:54:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 07:54:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 07:54:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 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-14 07:54:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2024-10-14 07:54:56,491 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 159 [2024-10-14 07:54:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:54:56,491 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2024-10-14 07:54:56,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-14 07:54:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2024-10-14 07:54:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:54:56,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:54:56,494 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] [2024-10-14 07:54:56,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:54:56,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:54:56,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:54:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1493048719, now seen corresponding path program 1 times [2024-10-14 07:54:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:54:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011661304] [2024-10-14 07:54:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:54:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:54:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:54:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:54:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:54:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:54:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:54:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:54:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:54:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:54:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:54:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:54:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:54:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:54:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:54:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:54:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:54:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:54:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:54:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:54:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:54:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:54:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:54:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:54:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:54:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:54:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:54:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:54:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:56,923 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-14 07:54:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:54:56,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011661304] [2024-10-14 07:54:56,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011661304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:54:56,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:54:56,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:54:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826626287] [2024-10-14 07:54:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:54:56,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:54:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:54:56,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:54:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:54:56,930 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-14 07:54:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:54:57,155 INFO L93 Difference]: Finished difference Result 250 states and 385 transitions. [2024-10-14 07:54:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:54:57,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 159 [2024-10-14 07:54:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:54:57,158 INFO L225 Difference]: With dead ends: 250 [2024-10-14 07:54:57,158 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 07:54:57,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-10-14 07:54:57,163 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 183 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:54:57,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 440 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:54:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 07:54:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 71. [2024-10-14 07:54:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 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-14 07:54:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-14 07:54:57,185 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 159 [2024-10-14 07:54:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:54:57,187 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-14 07:54:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-14 07:54:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-14 07:54:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:54:57,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:54:57,190 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] [2024-10-14 07:54:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:54:57,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:54:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:54:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1026911215, now seen corresponding path program 1 times [2024-10-14 07:54:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:54:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82778148] [2024-10-14 07:54:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:54:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:54:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:54:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:54:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:54:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:54:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:54:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:54:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:54:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:54:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:54:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:54:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:54:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:54:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:54:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:54:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:54:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:54:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:54:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:54:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:54:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:54:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:54:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:54:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:54:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:54:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:54:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:54:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:57,438 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-14 07:54:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:54:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82778148] [2024-10-14 07:54:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82778148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:54:57,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:54:57,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:54:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886005379] [2024-10-14 07:54:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:54:57,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:54:57,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:54:57,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:54:57,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:54:57,441 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-14 07:54:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:54:57,606 INFO L93 Difference]: Finished difference Result 254 states and 390 transitions. [2024-10-14 07:54:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:54:57,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 159 [2024-10-14 07:54:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:54:57,611 INFO L225 Difference]: With dead ends: 254 [2024-10-14 07:54:57,612 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 07:54:57,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-10-14 07:54:57,614 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 173 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:54:57,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 462 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:54:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 07:54:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 71. [2024-10-14 07:54:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 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-14 07:54:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-14 07:54:57,629 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 159 [2024-10-14 07:54:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:54:57,631 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-14 07:54:57,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-14 07:54:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-14 07:54:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:54:57,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:54:57,635 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] [2024-10-14 07:54:57,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:54:57,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:54:57,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:54:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1925373071, now seen corresponding path program 1 times [2024-10-14 07:54:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:54:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522493599] [2024-10-14 07:54:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:54:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:54:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:54:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:54:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:54:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:54:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:54:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:54:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:54:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:54:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:54:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:54:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:54:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:54:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:54:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:54:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:54:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:54:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:54:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:54:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:54:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:54:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:54:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:54:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:54:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:54:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:54:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:54:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:54:59,765 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-14 07:54:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:54:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522493599] [2024-10-14 07:54:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522493599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:54:59,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:54:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:54:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113971835] [2024-10-14 07:54:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:54:59,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:54:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:54:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:54:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:54:59,767 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-14 07:54:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:54:59,950 INFO L93 Difference]: Finished difference Result 198 states and 305 transitions. [2024-10-14 07:54:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:54:59,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 159 [2024-10-14 07:54:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:54:59,952 INFO L225 Difference]: With dead ends: 198 [2024-10-14 07:54:59,953 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 07:54:59,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:54:59,955 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 106 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:54:59,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 542 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:54:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 07:54:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 67. [2024-10-14 07:54:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-14 07:54:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-14 07:54:59,968 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 159 [2024-10-14 07:54:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:54:59,968 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-14 07:54:59,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-14 07:54:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-14 07:54:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 07:54:59,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:54:59,970 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] [2024-10-14 07:54:59,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:54:59,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:54:59,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:54:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash -72549164, now seen corresponding path program 1 times [2024-10-14 07:54:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:54:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668051073] [2024-10-14 07:54:59,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:54:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:54:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:55:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:55:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:55:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:55:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:55:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:55:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:55:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:55:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:55:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:55:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:55:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:55:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:55:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:55:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:55:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:55:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:55:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:55:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:55:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:55:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:55:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:55:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:55:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:55:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:55:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:55:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:55:05,158 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-14 07:55:05,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:55:05,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668051073] [2024-10-14 07:55:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668051073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:55:05,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:55:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:55:05,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626100243] [2024-10-14 07:55:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:55:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:55:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:55:05,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:55:05,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:55:05,162 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-14 07:55:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:55:06,010 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2024-10-14 07:55:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:55:06,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 161 [2024-10-14 07:55:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:55:06,012 INFO L225 Difference]: With dead ends: 284 [2024-10-14 07:55:06,012 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 07:55:06,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:55:06,014 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 233 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:55:06,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 437 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:55:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 07:55:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 161. [2024-10-14 07:55:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 113 states have internal predecessors, (151), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 07:55:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 243 transitions. [2024-10-14 07:55:06,053 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 243 transitions. Word has length 161 [2024-10-14 07:55:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:55:06,053 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 243 transitions. [2024-10-14 07:55:06,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-14 07:55:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 243 transitions. [2024-10-14 07:55:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 07:55:06,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:55:06,055 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] [2024-10-14 07:55:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:55:06,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:55:06,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:55:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 607509206, now seen corresponding path program 1 times [2024-10-14 07:55:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:55:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685028231] [2024-10-14 07:55:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:55:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:55:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat