./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05397c7941b2acd95b1b6d02c6c64b476ab8b290a5b56301ff8db7ca1986067b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:16:07,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:16:07,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:16:07,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:16:07,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:16:07,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:16:07,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:16:07,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:16:07,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:16:07,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:16:07,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:16:07,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:16:07,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:16:07,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:16:07,342 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:16:07,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:16:07,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:16:07,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:16:07,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:16:07,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:16:07,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:16:07,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:16:07,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:16:07,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:16:07,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:16:07,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:16:07,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:16:07,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:16:07,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:16:07,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:16:07,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:16:07,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:16:07,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:16:07,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:16:07,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:16:07,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:16:07,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:16:07,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:16:07,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:16:07,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:16:07,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:16:07,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:16:07,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05397c7941b2acd95b1b6d02c6c64b476ab8b290a5b56301ff8db7ca1986067b [2024-10-11 03:16:07,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:16:07,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:16:07,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:16:07,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:16:07,652 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:16:07,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c [2024-10-11 03:16:09,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:16:09,374 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:16:09,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c [2024-10-11 03:16:09,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f734b5321/bb7ac50c586a47078621b139bdefa33d/FLAG0b62f183f [2024-10-11 03:16:09,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f734b5321/bb7ac50c586a47078621b139bdefa33d [2024-10-11 03:16:09,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:16:09,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:16:09,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:16:09,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:16:09,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:16:09,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:09,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba12b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09, skipping insertion in model container [2024-10-11 03:16:09,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:09,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:16:09,668 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/systemc/transmitter.15.cil.c[706,719] [2024-10-11 03:16:09,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:16:09,867 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:16:09,882 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/systemc/transmitter.15.cil.c[706,719] [2024-10-11 03:16:09,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:16:09,977 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:16:09,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09 WrapperNode [2024-10-11 03:16:09,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:16:09,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:16:09,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:16:09,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:16:09,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,086 INFO L138 Inliner]: procedures = 54, calls = 69, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 918 [2024-10-11 03:16:10,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:16:10,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:16:10,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:16:10,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:16:10,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,135 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:16:10,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:16:10,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:16:10,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:16:10,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:16:10,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (1/1) ... [2024-10-11 03:16:10,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:16:10,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:16:10,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:16:10,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:16:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:16:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:16:10,287 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:16:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:16:10,287 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:16:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:16:10,288 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:16:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:16:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:16:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:16:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:16:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:16:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:16:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:16:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:16:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:16:10,498 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:16:10,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:16:11,447 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-11 03:16:11,447 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:16:11,535 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:16:11,539 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-11 03:16:11,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:16:11 BoogieIcfgContainer [2024-10-11 03:16:11,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:16:11,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:16:11,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:16:11,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:16:11,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:16:09" (1/3) ... [2024-10-11 03:16:11,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c7efa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:16:11, skipping insertion in model container [2024-10-11 03:16:11,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:09" (2/3) ... [2024-10-11 03:16:11,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c7efa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:16:11, skipping insertion in model container [2024-10-11 03:16:11,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:16:11" (3/3) ... [2024-10-11 03:16:11,551 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.15.cil.c [2024-10-11 03:16:11,569 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:16:11,569 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:16:11,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:16:11,675 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;@3256180a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:16:11,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:16:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 366 states, 332 states have (on average 1.7409638554216869) internal successors, (578), 334 states have internal predecessors, (578), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:16:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:11,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:11,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:11,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:11,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 221390487, now seen corresponding path program 1 times [2024-10-11 03:16:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759023443] [2024-10-11 03:16:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:12,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759023443] [2024-10-11 03:16:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759023443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:16:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071185004] [2024-10-11 03:16:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:12,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:16:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:16:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:16:12,452 INFO L87 Difference]: Start difference. First operand has 366 states, 332 states have (on average 1.7409638554216869) internal successors, (578), 334 states have internal predecessors, (578), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:14,770 INFO L93 Difference]: Finished difference Result 866 states and 1500 transitions. [2024-10-11 03:16:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:16:14,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:14,794 INFO L225 Difference]: With dead ends: 866 [2024-10-11 03:16:14,795 INFO L226 Difference]: Without dead ends: 502 [2024-10-11 03:16:14,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:16:14,811 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1035 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:14,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 655 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:16:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-11 03:16:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 364. [2024-10-11 03:16:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 331 states have (on average 1.6314199395770392) internal successors, (540), 332 states have internal predecessors, (540), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:16:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 592 transitions. [2024-10-11 03:16:14,905 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 592 transitions. Word has length 166 [2024-10-11 03:16:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:14,905 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 592 transitions. [2024-10-11 03:16:14,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 592 transitions. [2024-10-11 03:16:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:14,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:14,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:14,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:16:14,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:14,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1182478699, now seen corresponding path program 1 times [2024-10-11 03:16:14,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:14,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081250740] [2024-10-11 03:16:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:15,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:15,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:15,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081250740] [2024-10-11 03:16:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081250740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:16:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83458913] [2024-10-11 03:16:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:15,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:16:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:15,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:16:15,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:16:15,241 INFO L87 Difference]: Start difference. First operand 364 states and 592 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:17,274 INFO L93 Difference]: Finished difference Result 854 states and 1409 transitions. [2024-10-11 03:16:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:16:17,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:17,280 INFO L225 Difference]: With dead ends: 854 [2024-10-11 03:16:17,280 INFO L226 Difference]: Without dead ends: 502 [2024-10-11 03:16:17,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:16:17,283 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1024 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:17,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 650 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:16:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-11 03:16:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 364. [2024-10-11 03:16:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 331 states have (on average 1.6283987915407856) internal successors, (539), 332 states have internal predecessors, (539), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:16:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 591 transitions. [2024-10-11 03:16:17,322 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 591 transitions. Word has length 166 [2024-10-11 03:16:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:17,323 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 591 transitions. [2024-10-11 03:16:17,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 591 transitions. [2024-10-11 03:16:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:17,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:17,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:17,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:16:17,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:17,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash 222712979, now seen corresponding path program 1 times [2024-10-11 03:16:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317211210] [2024-10-11 03:16:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:17,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:17,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:17,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:17,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317211210] [2024-10-11 03:16:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317211210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:17,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:17,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:16:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306084866] [2024-10-11 03:16:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:17,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:16:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:16:17,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:16:17,774 INFO L87 Difference]: Start difference. First operand 364 states and 591 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:20,824 INFO L93 Difference]: Finished difference Result 1350 states and 2255 transitions. [2024-10-11 03:16:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:16:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:20,834 INFO L225 Difference]: With dead ends: 1350 [2024-10-11 03:16:20,834 INFO L226 Difference]: Without dead ends: 1005 [2024-10-11 03:16:20,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:16:20,838 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1558 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:20,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 1100 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 03:16:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-10-11 03:16:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 730. [2024-10-11 03:16:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 669 states have (on average 1.6367713004484306) internal successors, (1095), 671 states have internal predecessors, (1095), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-11 03:16:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1192 transitions. [2024-10-11 03:16:20,918 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1192 transitions. Word has length 166 [2024-10-11 03:16:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:20,918 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1192 transitions. [2024-10-11 03:16:20,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1192 transitions. [2024-10-11 03:16:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:20,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:20,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:16:20,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -476509774, now seen corresponding path program 1 times [2024-10-11 03:16:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541117545] [2024-10-11 03:16:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:21,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:21,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541117545] [2024-10-11 03:16:21,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541117545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:21,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296794306] [2024-10-11 03:16:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:21,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:21,321 INFO L87 Difference]: Start difference. First operand 730 states and 1192 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:26,221 INFO L93 Difference]: Finished difference Result 2406 states and 3988 transitions. [2024-10-11 03:16:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:16:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:26,234 INFO L225 Difference]: With dead ends: 2406 [2024-10-11 03:16:26,234 INFO L226 Difference]: Without dead ends: 1695 [2024-10-11 03:16:26,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:16:26,238 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 1725 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 4906 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 4969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:26,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 2122 Invalid, 4969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4906 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 03:16:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2024-10-11 03:16:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1068. [2024-10-11 03:16:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 979 states have (on average 1.6292134831460674) internal successors, (1595), 982 states have internal predecessors, (1595), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 03:16:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1736 transitions. [2024-10-11 03:16:26,345 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1736 transitions. Word has length 166 [2024-10-11 03:16:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:26,346 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1736 transitions. [2024-10-11 03:16:26,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1736 transitions. [2024-10-11 03:16:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:26,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:26,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:16:26,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash -138222224, now seen corresponding path program 1 times [2024-10-11 03:16:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353055297] [2024-10-11 03:16:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:26,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:26,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:26,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:26,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:26,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353055297] [2024-10-11 03:16:26,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353055297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:26,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:26,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:26,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762458640] [2024-10-11 03:16:26,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:26,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:26,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:26,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:26,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:26,740 INFO L87 Difference]: Start difference. First operand 1068 states and 1736 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:31,394 INFO L93 Difference]: Finished difference Result 3711 states and 6140 transitions. [2024-10-11 03:16:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:16:31,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:31,406 INFO L225 Difference]: With dead ends: 3711 [2024-10-11 03:16:31,406 INFO L226 Difference]: Without dead ends: 2662 [2024-10-11 03:16:31,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:16:31,410 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1719 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 4885 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 4950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:31,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 2120 Invalid, 4950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4885 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 03:16:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2024-10-11 03:16:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 1748. [2024-10-11 03:16:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1603 states have (on average 1.6232064878353087) internal successors, (2602), 1608 states have internal predecessors, (2602), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 03:16:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2835 transitions. [2024-10-11 03:16:31,522 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2835 transitions. Word has length 166 [2024-10-11 03:16:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:31,523 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2835 transitions. [2024-10-11 03:16:31,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2835 transitions. [2024-10-11 03:16:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:31,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:31,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:16:31,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:31,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash -678651730, now seen corresponding path program 1 times [2024-10-11 03:16:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011769174] [2024-10-11 03:16:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:31,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011769174] [2024-10-11 03:16:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011769174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230075606] [2024-10-11 03:16:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:31,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:31,867 INFO L87 Difference]: Start difference. First operand 1748 states and 2835 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:36,800 INFO L93 Difference]: Finished difference Result 6219 states and 10251 transitions. [2024-10-11 03:16:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:16:36,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:36,819 INFO L225 Difference]: With dead ends: 6219 [2024-10-11 03:16:36,819 INFO L226 Difference]: Without dead ends: 4490 [2024-10-11 03:16:36,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:16:36,828 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1718 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 4872 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 4937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:36,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 2120 Invalid, 4937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4872 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 03:16:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2024-10-11 03:16:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3109. [2024-10-11 03:16:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 2852 states have (on average 1.6185133239831697) internal successors, (4616), 2861 states have internal predecessors, (4616), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 03:16:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 5039 transitions. [2024-10-11 03:16:37,049 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 5039 transitions. Word has length 166 [2024-10-11 03:16:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:37,049 INFO L471 AbstractCegarLoop]: Abstraction has 3109 states and 5039 transitions. [2024-10-11 03:16:37,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 5039 transitions. [2024-10-11 03:16:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:37,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:37,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:16:37,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash -834632272, now seen corresponding path program 1 times [2024-10-11 03:16:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114314337] [2024-10-11 03:16:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:37,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:37,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:37,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114314337] [2024-10-11 03:16:37,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114314337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:37,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:37,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:37,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036022824] [2024-10-11 03:16:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:37,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:37,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:37,367 INFO L87 Difference]: Start difference. First operand 3109 states and 5039 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:42,007 INFO L93 Difference]: Finished difference Result 11234 states and 18489 transitions. [2024-10-11 03:16:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:16:42,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:42,044 INFO L225 Difference]: With dead ends: 11234 [2024-10-11 03:16:42,044 INFO L226 Difference]: Without dead ends: 8144 [2024-10-11 03:16:42,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:16:42,057 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1717 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 4859 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 4924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:42,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2120 Invalid, 4924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4859 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 03:16:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8144 states. [2024-10-11 03:16:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8144 to 5838. [2024-10-11 03:16:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5838 states, 5357 states have (on average 1.6154564121709911) internal successors, (8654), 5374 states have internal predecessors, (8654), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 03:16:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 9475 transitions. [2024-10-11 03:16:42,472 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 9475 transitions. Word has length 166 [2024-10-11 03:16:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:42,473 INFO L471 AbstractCegarLoop]: Abstraction has 5838 states and 9475 transitions. [2024-10-11 03:16:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 9475 transitions. [2024-10-11 03:16:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:42,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:42,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:42,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:16:42,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:42,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash -424021906, now seen corresponding path program 1 times [2024-10-11 03:16:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356741934] [2024-10-11 03:16:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356741934] [2024-10-11 03:16:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356741934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128466458] [2024-10-11 03:16:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:42,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:42,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:42,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:42,761 INFO L87 Difference]: Start difference. First operand 5838 states and 9475 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:47,569 INFO L93 Difference]: Finished difference Result 21265 states and 35027 transitions. [2024-10-11 03:16:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:16:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:47,634 INFO L225 Difference]: With dead ends: 21265 [2024-10-11 03:16:47,634 INFO L226 Difference]: Without dead ends: 15446 [2024-10-11 03:16:47,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:16:47,666 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1716 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 4846 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 4911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:47,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 2120 Invalid, 4911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4846 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 03:16:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15446 states. [2024-10-11 03:16:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15446 to 11311. [2024-10-11 03:16:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11311 states, 10382 states have (on average 1.6135619341167404) internal successors, (16752), 10415 states have internal predecessors, (16752), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-11 03:16:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11311 states to 11311 states and 18423 transitions. [2024-10-11 03:16:48,539 INFO L78 Accepts]: Start accepts. Automaton has 11311 states and 18423 transitions. Word has length 166 [2024-10-11 03:16:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:48,542 INFO L471 AbstractCegarLoop]: Abstraction has 11311 states and 18423 transitions. [2024-10-11 03:16:48,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11311 states and 18423 transitions. [2024-10-11 03:16:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:48,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:48,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:16:48,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2083075568, now seen corresponding path program 1 times [2024-10-11 03:16:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695321020] [2024-10-11 03:16:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:48,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695321020] [2024-10-11 03:16:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695321020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:48,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:48,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:48,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101194831] [2024-10-11 03:16:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:48,978 INFO L87 Difference]: Start difference. First operand 11311 states and 18423 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:54,172 INFO L93 Difference]: Finished difference Result 41328 states and 68297 transitions. [2024-10-11 03:16:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:16:54,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:16:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:54,393 INFO L225 Difference]: With dead ends: 41328 [2024-10-11 03:16:54,393 INFO L226 Difference]: Without dead ends: 30036 [2024-10-11 03:16:54,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:16:54,449 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1821 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 4203 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:54,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 1388 Invalid, 4304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4203 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 03:16:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30036 states. [2024-10-11 03:16:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30036 to 22288. [2024-10-11 03:16:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22288 states, 20463 states have (on average 1.6123735522650637) internal successors, (32994), 20528 states have internal predecessors, (32994), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 03:16:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22288 states to 22288 states and 36527 transitions. [2024-10-11 03:16:56,177 INFO L78 Accepts]: Start accepts. Automaton has 22288 states and 36527 transitions. Word has length 166 [2024-10-11 03:16:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:56,178 INFO L471 AbstractCegarLoop]: Abstraction has 22288 states and 36527 transitions. [2024-10-11 03:16:56,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 22288 states and 36527 transitions. [2024-10-11 03:16:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:16:56,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:56,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:56,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:16:56,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:56,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash -52807634, now seen corresponding path program 1 times [2024-10-11 03:16:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218739187] [2024-10-11 03:16:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:16:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:16:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:16:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:16:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:56,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218739187] [2024-10-11 03:16:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218739187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:56,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640320453] [2024-10-11 03:16:56,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:56,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:56,482 INFO L87 Difference]: Start difference. First operand 22288 states and 36527 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:17:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:03,457 INFO L93 Difference]: Finished difference Result 81455 states and 135439 transitions. [2024-10-11 03:17:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:17:03,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:17:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:03,778 INFO L225 Difference]: With dead ends: 81455 [2024-10-11 03:17:03,778 INFO L226 Difference]: Without dead ends: 59186 [2024-10-11 03:17:03,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:17:03,874 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1714 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 4820 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 4885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:03,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 2120 Invalid, 4885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4820 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 03:17:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59186 states. [2024-10-11 03:17:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59186 to 44305. [2024-10-11 03:17:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44305 states, 40688 states have (on average 1.6115808100668503) internal successors, (65572), 40817 states have internal predecessors, (65572), 2714 states have call successors, (2714), 774 states have call predecessors, (2714), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-10-11 03:17:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44305 states to 44305 states and 73315 transitions. [2024-10-11 03:17:07,124 INFO L78 Accepts]: Start accepts. Automaton has 44305 states and 73315 transitions. Word has length 166 [2024-10-11 03:17:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:07,125 INFO L471 AbstractCegarLoop]: Abstraction has 44305 states and 73315 transitions. [2024-10-11 03:17:07,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:17:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 44305 states and 73315 transitions. [2024-10-11 03:17:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:17:07,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:07,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:07,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:17:07,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash 16840240, now seen corresponding path program 1 times [2024-10-11 03:17:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011126296] [2024-10-11 03:17:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:17:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:17:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011126296] [2024-10-11 03:17:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011126296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:07,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:07,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:07,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558819723] [2024-10-11 03:17:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:07,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:07,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:07,412 INFO L87 Difference]: Start difference. First operand 44305 states and 73315 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:17:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:17,101 INFO L93 Difference]: Finished difference Result 161710 states and 271573 transitions. [2024-10-11 03:17:17,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:17:17,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2024-10-11 03:17:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:17,935 INFO L225 Difference]: With dead ends: 161710 [2024-10-11 03:17:17,936 INFO L226 Difference]: Without dead ends: 117424 [2024-10-11 03:17:18,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:17:18,091 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1719 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 4802 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 4867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:18,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 2120 Invalid, 4867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4802 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 03:17:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117424 states. [2024-10-11 03:17:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117424 to 88466. [2024-10-11 03:17:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88466 states, 81265 states have (on average 1.6110010459607458) internal successors, (130918), 81522 states have internal predecessors, (130918), 5402 states have call successors, (5402), 1542 states have call predecessors, (5402), 1798 states have return successors, (12219), 5657 states have call predecessors, (12219), 5402 states have call successors, (12219) [2024-10-11 03:17:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88466 states to 88466 states and 148539 transitions. [2024-10-11 03:17:24,514 INFO L78 Accepts]: Start accepts. Automaton has 88466 states and 148539 transitions. Word has length 166 [2024-10-11 03:17:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:24,515 INFO L471 AbstractCegarLoop]: Abstraction has 88466 states and 148539 transitions. [2024-10-11 03:17:24,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:17:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88466 states and 148539 transitions. [2024-10-11 03:17:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:17:24,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:24,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:17:24,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash 434728942, now seen corresponding path program 1 times [2024-10-11 03:17:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206102057] [2024-10-11 03:17:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:17:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:17:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206102057] [2024-10-11 03:17:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206102057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:24,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:24,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:24,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426073544] [2024-10-11 03:17:24,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:24,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:24,895 INFO L87 Difference]: Start difference. First operand 88466 states and 148539 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)