./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.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 4623efc2673ee52abd070f0d21e51a11b98cc22b8397a5181b7ee0443b3e1285 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:21:08,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:21:08,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:21:08,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:21:08,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:21:08,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:21:08,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:21:08,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:21:08,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:21:08,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:21:08,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:21:08,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:21:08,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:21:08,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:21:08,474 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:21:08,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:21:08,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:21:08,475 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:21:08,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:21:08,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:21:08,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:21:08,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:21:08,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:21:08,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:21:08,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:21:08,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:21:08,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:21:08,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:21:08,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:21:08,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:21:08,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:21:08,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:21:08,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:21:08,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:21:08,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:21:08,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:21:08,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:21:08,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:21:08,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:21:08,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:21:08,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:21:08,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:21:08,487 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 -> 4623efc2673ee52abd070f0d21e51a11b98cc22b8397a5181b7ee0443b3e1285 [2024-11-08 20:21:08,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:21:08,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:21:08,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:21:08,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:21:08,739 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:21:08,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-11-08 20:21:10,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:21:10,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:21:10,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-11-08 20:21:10,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f67cd8f/1041e6add7df43ba88b8f5fa61d5509a/FLAG04b783e13 [2024-11-08 20:21:10,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f67cd8f/1041e6add7df43ba88b8f5fa61d5509a [2024-11-08 20:21:10,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:21:10,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:21:10,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:21:10,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:21:10,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:21:10,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:21:10" (1/1) ... [2024-11-08 20:21:10,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6754b1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:10, skipping insertion in model container [2024-11-08 20:21:10,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:21:10" (1/1) ... [2024-11-08 20:21:10,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:21:10,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i[915,928] [2024-11-08 20:21:10,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:21:11,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:21:11,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i[915,928] [2024-11-08 20:21:11,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:21:11,086 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:21:11,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11 WrapperNode [2024-11-08 20:21:11,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:21:11,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:21:11,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:21:11,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:21:11,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,154 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-08 20:21:11,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:21:11,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:21:11,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:21:11,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:21:11,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:21:11,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:21:11,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:21:11,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:21:11,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:21:11,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (1/1) ... [2024-11-08 20:21:11,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:21:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:21:11,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:21:11,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:21:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:21:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:21:11,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:21:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:21:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:21:11,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:21:11,521 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:21:11,525 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:21:11,951 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:21:11,951 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:21:11,967 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:21:11,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:21:11,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:21:11 BoogieIcfgContainer [2024-11-08 20:21:11,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:21:11,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:21:11,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:21:11,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:21:11,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:21:10" (1/3) ... [2024-11-08 20:21:11,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:21:11, skipping insertion in model container [2024-11-08 20:21:11,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:21:11" (2/3) ... [2024-11-08 20:21:11,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:21:11, skipping insertion in model container [2024-11-08 20:21:11,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:21:11" (3/3) ... [2024-11-08 20:21:11,980 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-11-08 20:21:11,995 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:21:11,996 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:21:12,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:21:12,084 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;@51e6582f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:21:12,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:21:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 20:21:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:21:12,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:21:12,111 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:21:12,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:21:12,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:21:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash 101934033, now seen corresponding path program 1 times [2024-11-08 20:21:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:21:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588050147] [2024-11-08 20:21:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:21:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:21:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:21:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:21:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:21:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:21:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:21:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:21:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:21:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:21:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:21:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:21:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:21:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:21:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:21:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:21:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:21:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:21:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:21:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:21:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:21:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:21:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:21:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:21:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:21:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:21:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:21:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:21:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:21:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:21:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:21:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:21:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:21:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:21:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:21:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 20:21:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:21:12,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:21:12,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588050147] [2024-11-08 20:21:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588050147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:21:12,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:21:12,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:21:12,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095946174] [2024-11-08 20:21:12,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:21:12,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:21:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:21:12,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:21:12,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:21:12,716 INFO L87 Difference]: Start difference. First operand has 88 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 20:21:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:21:12,755 INFO L93 Difference]: Finished difference Result 169 states and 300 transitions. [2024-11-08 20:21:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:21:12,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 210 [2024-11-08 20:21:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:21:12,765 INFO L225 Difference]: With dead ends: 169 [2024-11-08 20:21:12,765 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 20:21:12,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:21:12,774 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:21:12,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:21:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 20:21:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 20:21:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 20:21:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-08 20:21:12,834 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 210 [2024-11-08 20:21:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:21:12,835 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-08 20:21:12,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 20:21:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-08 20:21:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:21:12,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:21:12,841 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:21:12,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:21:12,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:21:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:21:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1343309167, now seen corresponding path program 1 times [2024-11-08 20:21:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:21:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373709929] [2024-11-08 20:21:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:21:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:21:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:21:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:21:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:21:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:21:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:21:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:21:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:21:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:21:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:21:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:21:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:21:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:21:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:21:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:21:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:21:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:21:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:21:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:21:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:21:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:21:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:21:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:21:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:21:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:21:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:21:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:21:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:21:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:21:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:21:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:21:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:21:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:21:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:21:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 20:21:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:21:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:21:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373709929] [2024-11-08 20:21:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373709929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:21:13,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:21:13,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:21:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82111967] [2024-11-08 20:21:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:21:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:21:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:21:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:21:13,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:21:13,227 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:21:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:21:13,286 INFO L93 Difference]: Finished difference Result 232 states and 357 transitions. [2024-11-08 20:21:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:21:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-11-08 20:21:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:21:13,293 INFO L225 Difference]: With dead ends: 232 [2024-11-08 20:21:13,295 INFO L226 Difference]: Without dead ends: 151 [2024-11-08 20:21:13,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-11-08 20:21:13,297 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:21:13,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 246 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:21:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-08 20:21:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-11-08 20:21:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 84 states have internal predecessors, (104), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 20:21:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2024-11-08 20:21:13,333 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 210 [2024-11-08 20:21:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:21:13,334 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2024-11-08 20:21:13,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:21:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2024-11-08 20:21:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:21:13,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:21:13,337 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:21:13,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:21:13,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:21:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:21:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -63445489, now seen corresponding path program 1 times [2024-11-08 20:21:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:21:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257029540] [2024-11-08 20:21:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:21:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:21:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:21:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:21:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:21:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:21:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:21:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:21:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:21:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:21:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:21:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:21:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:21:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:21:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:21:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:21:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:21:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:21:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:21:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:21:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:21:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:21:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:21:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:21:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:21:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:21:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:21:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:21:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:21:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:21:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:21:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:21:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:21:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:21:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:21:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 20:21:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:21:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:21:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:21:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257029540] [2024-11-08 20:21:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257029540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:21:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:21:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:21:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482287298] [2024-11-08 20:21:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:21:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:21:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:21:14,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:21:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:21:14,310 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:21:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:21:14,425 INFO L93 Difference]: Finished difference Result 373 states and 563 transitions. [2024-11-08 20:21:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:21:14,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-11-08 20:21:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:21:14,431 INFO L225 Difference]: With dead ends: 373 [2024-11-08 20:21:14,431 INFO L226 Difference]: Without dead ends: 228 [2024-11-08 20:21:14,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:21:14,433 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 71 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:21:14,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 396 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:21:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-08 20:21:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 202. [2024-11-08 20:21:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 130 states have internal predecessors, (164), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 20:21:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2024-11-08 20:21:14,461 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 210 [2024-11-08 20:21:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:21:14,462 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2024-11-08 20:21:14,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:21:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2024-11-08 20:21:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:21:14,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:21:14,465 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:21:14,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:21:14,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:21:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:21:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash -872792115, now seen corresponding path program 1 times [2024-11-08 20:21:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:21:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258594943] [2024-11-08 20:21:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:21:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:21:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat