./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_ps-cn-25_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_ps-cn-25_file-59.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 b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:08:18,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:08:18,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:08:18,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:08:18,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:08:18,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:08:18,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:08:18,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:08:18,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:08:18,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:08:18,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:08:18,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:08:18,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:08:18,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:08:18,968 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:08:18,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:08:18,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:08:18,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:08:18,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:08:18,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:08:18,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:08:18,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:08:18,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:08:18,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:08:18,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:08:18,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:08:18,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:08:18,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:08:18,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:08:18,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:08:18,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:08:18,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:08:18,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:08:18,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:08:18,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:08:18,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:08:18,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:08:18,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:08:18,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:08:18,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:08:18,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:08:18,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:08:18,978 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 -> b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 [2024-10-13 01:08:19,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:08:19,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:08:19,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:08:19,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:08:19,233 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:08:19,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-10-13 01:08:20,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:08:20,759 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:08:20,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-10-13 01:08:20,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3dc164d/a581d494dac8458da8e893bdc9c853b5/FLAGd8f1c51d7 [2024-10-13 01:08:21,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3dc164d/a581d494dac8458da8e893bdc9c853b5 [2024-10-13 01:08:21,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:08:21,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:08:21,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:08:21,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:08:21,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:08:21,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b365c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21, skipping insertion in model container [2024-10-13 01:08:21,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:08:21,315 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_ps-cn-25_file-59.i[915,928] [2024-10-13 01:08:21,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:08:21,403 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:08:21,427 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_ps-cn-25_file-59.i[915,928] [2024-10-13 01:08:21,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:08:21,483 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:08:21,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21 WrapperNode [2024-10-13 01:08:21,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:08:21,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:08:21,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:08:21,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:08:21,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,551 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-10-13 01:08:21,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:08:21,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:08:21,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:08:21,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:08:21,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,580 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-13 01:08:21,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:08:21,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:08:21,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:08:21,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:08:21,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (1/1) ... [2024-10-13 01:08:21,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:08:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:08:21,642 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-13 01:08:21,649 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-13 01:08:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:08:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:08:21,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:08:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:08:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:08:21,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:08:21,778 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:08:21,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:08:22,138 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 01:08:22,142 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:08:22,180 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:08:22,181 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:08:22,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:22 BoogieIcfgContainer [2024-10-13 01:08:22,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:08:22,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:08:22,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:08:22,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:08:22,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:08:21" (1/3) ... [2024-10-13 01:08:22,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290627be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:22, skipping insertion in model container [2024-10-13 01:08:22,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:21" (2/3) ... [2024-10-13 01:08:22,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290627be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:22, skipping insertion in model container [2024-10-13 01:08:22,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:22" (3/3) ... [2024-10-13 01:08:22,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-10-13 01:08:22,204 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:08:22,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:08:22,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:08:22,262 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;@db9682f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:08:22,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:08:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 01:08:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 01:08:22,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:22,278 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:22,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:22,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 378850979, now seen corresponding path program 1 times [2024-10-13 01:08:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:22,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643153071] [2024-10-13 01:08:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:22,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 01:08:22,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:22,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643153071] [2024-10-13 01:08:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643153071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:22,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:22,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:08:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650348248] [2024-10-13 01:08:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:22,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:08:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:22,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:08:22,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:08:22,782 INFO L87 Difference]: Start difference. First operand has 80 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 01:08:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:22,900 INFO L93 Difference]: Finished difference Result 157 states and 281 transitions. [2024-10-13 01:08:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:08:22,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2024-10-13 01:08:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:22,910 INFO L225 Difference]: With dead ends: 157 [2024-10-13 01:08:22,911 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 01:08:22,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-13 01:08:22,920 INFO L432 NwaCegarLoop]: 118 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, 118 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-13 01:08:22,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:08:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 01:08:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 01:08:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 01:08:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-13 01:08:22,964 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 171 [2024-10-13 01:08:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:22,964 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-13 01:08:22,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 01:08:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-13 01:08:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 01:08:22,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:22,970 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:22,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:08:22,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -475151251, now seen corresponding path program 1 times [2024-10-13 01:08:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:22,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285914565] [2024-10-13 01:08:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 01:08:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:23,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285914565] [2024-10-13 01:08:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285914565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:23,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:08:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510647516] [2024-10-13 01:08:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:23,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:08:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:08:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:08:23,415 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:23,613 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2024-10-13 01:08:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:08:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 01:08:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:23,616 INFO L225 Difference]: With dead ends: 217 [2024-10-13 01:08:23,616 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 01:08:23,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:08:23,618 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 92 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:23,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 293 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:08:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 01:08:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-10-13 01:08:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 88 states have internal predecessors, (118), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 01:08:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2024-10-13 01:08:23,649 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 171 [2024-10-13 01:08:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:23,650 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2024-10-13 01:08:23,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2024-10-13 01:08:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 01:08:23,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:23,656 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:23,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:08:23,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1061957265, now seen corresponding path program 1 times [2024-10-13 01:08:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705641045] [2024-10-13 01:08:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 01:08:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705641045] [2024-10-13 01:08:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705641045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:08:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63804457] [2024-10-13 01:08:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:24,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:08:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:24,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:08:24,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,076 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:24,148 INFO L93 Difference]: Finished difference Result 408 states and 633 transitions. [2024-10-13 01:08:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:08:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 01:08:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:24,153 INFO L225 Difference]: With dead ends: 408 [2024-10-13 01:08:24,153 INFO L226 Difference]: Without dead ends: 272 [2024-10-13 01:08:24,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,155 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 70 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:24,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 260 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:08:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-13 01:08:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2024-10-13 01:08:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 173 states have internal predecessors, (231), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-13 01:08:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 419 transitions. [2024-10-13 01:08:24,211 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 419 transitions. Word has length 171 [2024-10-13 01:08:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:24,216 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 419 transitions. [2024-10-13 01:08:24,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 419 transitions. [2024-10-13 01:08:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 01:08:24,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:24,220 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:24,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:08:24,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:24,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1724520794, now seen corresponding path program 1 times [2024-10-13 01:08:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:24,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125178168] [2024-10-13 01:08:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 01:08:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125178168] [2024-10-13 01:08:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125178168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:24,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:24,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:08:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034679524] [2024-10-13 01:08:24,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:24,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:08:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:08:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,418 INFO L87 Difference]: Start difference. First operand 270 states and 419 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:24,477 INFO L93 Difference]: Finished difference Result 539 states and 837 transitions. [2024-10-13 01:08:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:08:24,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-13 01:08:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:24,480 INFO L225 Difference]: With dead ends: 539 [2024-10-13 01:08:24,480 INFO L226 Difference]: Without dead ends: 270 [2024-10-13 01:08:24,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,486 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:24,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:08:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-13 01:08:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2024-10-13 01:08:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 172 states have internal predecessors, (226), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-13 01:08:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 414 transitions. [2024-10-13 01:08:24,527 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 414 transitions. Word has length 172 [2024-10-13 01:08:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:24,528 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 414 transitions. [2024-10-13 01:08:24,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 414 transitions. [2024-10-13 01:08:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 01:08:24,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:24,531 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:24,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:08:24,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1137714780, now seen corresponding path program 1 times [2024-10-13 01:08:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670468529] [2024-10-13 01:08:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 01:08:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670468529] [2024-10-13 01:08:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670468529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:24,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:08:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329699460] [2024-10-13 01:08:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:24,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:08:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:08:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:08:24,755 INFO L87 Difference]: Start difference. First operand 269 states and 414 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:24,972 INFO L93 Difference]: Finished difference Result 665 states and 1018 transitions. [2024-10-13 01:08:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:08:24,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-13 01:08:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:24,976 INFO L225 Difference]: With dead ends: 665 [2024-10-13 01:08:24,976 INFO L226 Difference]: Without dead ends: 397 [2024-10-13 01:08:24,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:08:24,982 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 81 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:24,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 347 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:08:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-13 01:08:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 347. [2024-10-13 01:08:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 219 states have (on average 1.2831050228310503) internal successors, (281), 221 states have internal predecessors, (281), 121 states have call successors, (121), 6 states have call predecessors, (121), 6 states have return successors, (121), 119 states have call predecessors, (121), 121 states have call successors, (121) [2024-10-13 01:08:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 523 transitions. [2024-10-13 01:08:25,024 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 523 transitions. Word has length 172 [2024-10-13 01:08:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:25,025 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 523 transitions. [2024-10-13 01:08:25,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 523 transitions. [2024-10-13 01:08:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 01:08:25,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:25,026 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:08:25,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:25,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash 681414775, now seen corresponding path program 1 times [2024-10-13 01:08:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:25,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903535557] [2024-10-13 01:08:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 01:08:25,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903535557] [2024-10-13 01:08:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903535557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:25,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:08:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047584551] [2024-10-13 01:08:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:25,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:08:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:08:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:25,246 INFO L87 Difference]: Start difference. First operand 347 states and 523 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:25,330 INFO L93 Difference]: Finished difference Result 882 states and 1321 transitions. [2024-10-13 01:08:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:08:25,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-10-13 01:08:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:25,335 INFO L225 Difference]: With dead ends: 882 [2024-10-13 01:08:25,336 INFO L226 Difference]: Without dead ends: 591 [2024-10-13 01:08:25,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:25,338 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 85 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:25,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 268 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:08:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-13 01:08:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 585. [2024-10-13 01:08:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 389 states have (on average 1.2956298200514138) internal successors, (504), 395 states have internal predecessors, (504), 185 states have call successors, (185), 10 states have call predecessors, (185), 10 states have return successors, (185), 179 states have call predecessors, (185), 185 states have call successors, (185) [2024-10-13 01:08:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 874 transitions. [2024-10-13 01:08:25,402 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 874 transitions. Word has length 173 [2024-10-13 01:08:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:25,403 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 874 transitions. [2024-10-13 01:08:25,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 874 transitions. [2024-10-13 01:08:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 01:08:25,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:25,405 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:25,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 01:08:25,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:25,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1312729931, now seen corresponding path program 1 times [2024-10-13 01:08:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252814201] [2024-10-13 01:08:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 01:08:25,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:25,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252814201] [2024-10-13 01:08:25,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252814201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:25,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:25,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:08:25,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862215525] [2024-10-13 01:08:25,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:25,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:08:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:08:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:08:25,680 INFO L87 Difference]: Start difference. First operand 585 states and 874 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:25,909 INFO L93 Difference]: Finished difference Result 1607 states and 2429 transitions. [2024-10-13 01:08:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:08:25,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-10-13 01:08:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:25,918 INFO L225 Difference]: With dead ends: 1607 [2024-10-13 01:08:25,918 INFO L226 Difference]: Without dead ends: 1125 [2024-10-13 01:08:25,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:08:25,921 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:25,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 335 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:08:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-10-13 01:08:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1065. [2024-10-13 01:08:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 703 states have (on average 1.2916073968705548) internal successors, (908), 715 states have internal predecessors, (908), 343 states have call successors, (343), 18 states have call predecessors, (343), 18 states have return successors, (343), 331 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 01:08:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1594 transitions. [2024-10-13 01:08:26,030 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1594 transitions. Word has length 173 [2024-10-13 01:08:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:26,030 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1594 transitions. [2024-10-13 01:08:26,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 01:08:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1594 transitions. [2024-10-13 01:08:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 01:08:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:26,036 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 01:08:26,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash -334904345, now seen corresponding path program 1 times [2024-10-13 01:08:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774031826] [2024-10-13 01:08:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:08:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:08:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:08:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:08:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:08:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:08:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:08:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:08:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:08:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:08:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:08:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:08:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:08:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:08:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:08:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:08:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:08:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:08:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:08:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:08:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:08:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:08:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:08:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:08:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 01:08:26,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:26,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774031826] [2024-10-13 01:08:26,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774031826] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:08:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946242700] [2024-10-13 01:08:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:08:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:08:26,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:08:26,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:08:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 01:08:26,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:08:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 722 proven. 42 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-13 01:08:27,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:08:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 01:08:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946242700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:08:27,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:08:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-10-13 01:08:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135413897] [2024-10-13 01:08:27,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:08:27,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 01:08:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 01:08:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-13 01:08:27,528 INFO L87 Difference]: Start difference. First operand 1065 states and 1594 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-13 01:08:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:28,811 INFO L93 Difference]: Finished difference Result 3441 states and 5025 transitions. [2024-10-13 01:08:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 01:08:28,812 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 174 [2024-10-13 01:08:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:28,826 INFO L225 Difference]: With dead ends: 3441 [2024-10-13 01:08:28,826 INFO L226 Difference]: Without dead ends: 2479 [2024-10-13 01:08:28,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2024-10-13 01:08:28,831 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 697 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:28,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 886 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:08:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2024-10-13 01:08:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 1205. [2024-10-13 01:08:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 826 states have (on average 1.257869249394673) internal successors, (1039), 838 states have internal predecessors, (1039), 343 states have call successors, (343), 35 states have call predecessors, (343), 35 states have return successors, (343), 331 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 01:08:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1725 transitions. [2024-10-13 01:08:28,959 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1725 transitions. Word has length 174 [2024-10-13 01:08:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:28,959 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1725 transitions. [2024-10-13 01:08:28,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-13 01:08:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1725 transitions. [2024-10-13 01:08:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 01:08:28,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:28,961 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:08:28,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:08:29,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:08:29,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:29,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash -392162647, now seen corresponding path program 1 times [2024-10-13 01:08:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:29,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376084348] [2024-10-13 01:08:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:08:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239551501] [2024-10-13 01:08:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:08:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:08:29,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:08:29,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:08:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:29,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 01:08:29,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:08:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 275 proven. 363 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-10-13 01:08:31,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:09:05,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse4 (mod c_~var_1_19~0 4294967296)) (.cse2 (div (mod c_~var_1_6~0 65536) .cse7))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296)) (.cse5 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse6 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse1 (+ .cse4 1))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (or (< .cse5 .cse3) (< .cse3 .cse6) (< .cse4 .cse3)) (forall ((v_z_6 Int)) (or (not (= (mod (* v_z_6 .cse2) 4294967296) v_z_6)) (< .cse5 v_z_6) (< v_z_6 .cse6) (< v_z_6 .cse1))))))) is different from false [2024-10-13 01:09:12,031 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 01:09:20,393 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)