./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w32_d64_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w32_d64_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bb2ba337516aec53a4c46f26391f25a8a9b61a5ba88ccfd603b3e7ee578ebf88 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:12:46,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:12:46,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-11 23:12:46,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:12:46,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:12:46,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:12:46,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:12:46,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:12:46,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:12:46,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:12:46,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:12:46,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:12:46,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:12:46,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:12:46,261 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:12:46,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:12:46,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:12:46,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 23:12:46,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:12:46,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:12:46,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:12:46,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:12:46,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:12:46,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:12:46,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:12:46,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:12:46,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:12:46,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:12:46,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:12:46,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:12:46,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:12:46,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:12:46,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:12:46,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 23:12:46,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 23:12:46,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:12:46,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:12:46,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:12:46,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:12:46,276 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb2ba337516aec53a4c46f26391f25a8a9b61a5ba88ccfd603b3e7ee578ebf88 [2024-11-11 23:12:46,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:12:46,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:12:46,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:12:46,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:12:46,588 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:12:46,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w32_d64_e0.c [2024-11-11 23:12:48,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:12:48,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:12:48,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w32_d64_e0.c [2024-11-11 23:12:48,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aac1a68/28b3b1459ae24361877c423a12e2e6a2/FLAG7f1a53261 [2024-11-11 23:12:48,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aac1a68/28b3b1459ae24361877c423a12e2e6a2 [2024-11-11 23:12:48,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:12:48,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:12:48,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:12:48,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:12:48,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:12:48,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:12:48" (1/1) ... [2024-11-11 23:12:48,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6576b820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:48, skipping insertion in model container [2024-11-11 23:12:48,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:12:48" (1/1) ... [2024-11-11 23:12:48,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:12:49,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w32_d64_e0.c[1325,1338] [2024-11-11 23:12:49,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:12:49,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:12:49,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w32_d64_e0.c[1325,1338] [2024-11-11 23:12:50,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:12:50,357 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:12:50,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50 WrapperNode [2024-11-11 23:12:50,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:12:50,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:12:50,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:12:50,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:12:50,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:50,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:52,165 INFO L138 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 15666 [2024-11-11 23:12:52,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:12:52,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:12:52,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:12:52,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:12:52,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:52,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:52,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:52,988 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 23:12:52,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:52,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:53,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:53,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:53,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:53,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:53,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:12:53,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:12:53,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:12:53,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:12:53,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (1/1) ... [2024-11-11 23:12:53,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:12:53,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:12:53,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 23:12:53,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 23:12:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:12:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 23:12:53,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 23:12:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 23:12:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:12:53,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:12:55,022 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:12:55,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:13:25,391 INFO L? ?]: Removed 9030 outVars from TransFormulas that were not future-live. [2024-11-11 23:13:25,391 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:13:25,462 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:13:25,462 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:13:25,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:13:25 BoogieIcfgContainer [2024-11-11 23:13:25,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:13:25,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:13:25,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:13:25,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:13:25,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:12:48" (1/3) ... [2024-11-11 23:13:25,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3270d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:13:25, skipping insertion in model container [2024-11-11 23:13:25,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:12:50" (2/3) ... [2024-11-11 23:13:25,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3270d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:13:25, skipping insertion in model container [2024-11-11 23:13:25,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:13:25" (3/3) ... [2024-11-11 23:13:25,472 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n3_w32_d64_e0.c [2024-11-11 23:13:25,491 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:13:25,491 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:13:25,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:13:25,646 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;@37bd5194, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:13:25,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:13:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 4362 states, 4349 states have (on average 1.498505403541044) internal successors, (6517), 4350 states have internal predecessors, (6517), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 23:13:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1166 [2024-11-11 23:13:25,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:13:25,737 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:13:25,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:13:25,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:13:25,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1584371349, now seen corresponding path program 1 times [2024-11-11 23:13:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:13:25,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101947483] [2024-11-11 23:13:25,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:13:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:13:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-11 23:13:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-11 23:13:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-11 23:13:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-11 23:13:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-11-11 23:13:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-11-11 23:13:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-11-11 23:13:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-11-11 23:13:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-11 23:13:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2024-11-11 23:13:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-11 23:13:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:13:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101947483] [2024-11-11 23:13:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101947483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:13:27,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:13:27,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 23:13:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105384353] [2024-11-11 23:13:27,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:13:27,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 23:13:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:13:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 23:13:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 23:13:27,645 INFO L87 Difference]: Start difference. First operand has 4362 states, 4349 states have (on average 1.498505403541044) internal successors, (6517), 4350 states have internal predecessors, (6517), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 559.0) internal successors, (1118), 2 states have internal predecessors, (1118), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 23:13:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:13:27,790 INFO L93 Difference]: Finished difference Result 7883 states and 11826 transitions. [2024-11-11 23:13:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 23:13:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 559.0) internal successors, (1118), 2 states have internal predecessors, (1118), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 1165 [2024-11-11 23:13:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:13:27,833 INFO L225 Difference]: With dead ends: 7883 [2024-11-11 23:13:27,834 INFO L226 Difference]: Without dead ends: 4359 [2024-11-11 23:13:27,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 23:13:27,852 INFO L435 NwaCegarLoop]: 6532 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6532 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:13:27,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6532 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:13:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2024-11-11 23:13:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4359. [2024-11-11 23:13:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4359 states, 4347 states have (on average 1.4980446284794111) internal successors, (6512), 4347 states have internal predecessors, (6512), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 23:13:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6532 transitions. [2024-11-11 23:13:28,056 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6532 transitions. Word has length 1165 [2024-11-11 23:13:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:13:28,061 INFO L471 AbstractCegarLoop]: Abstraction has 4359 states and 6532 transitions. [2024-11-11 23:13:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 559.0) internal successors, (1118), 2 states have internal predecessors, (1118), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 23:13:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6532 transitions. [2024-11-11 23:13:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1166 [2024-11-11 23:13:28,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:13:28,103 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:13:28,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 23:13:28,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:13:28,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:13:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1504895447, now seen corresponding path program 1 times [2024-11-11 23:13:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:13:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514956669] [2024-11-11 23:13:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:13:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:13:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-11 23:13:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-11 23:13:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-11 23:13:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-11 23:13:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-11-11 23:13:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-11-11 23:13:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-11-11 23:13:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-11-11 23:13:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-11 23:13:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2024-11-11 23:13:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-11 23:13:35,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:13:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514956669] [2024-11-11 23:13:35,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514956669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:13:35,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:13:35,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:13:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306417602] [2024-11-11 23:13:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:13:35,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:13:35,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:13:35,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:13:35,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:13:35,558 INFO L87 Difference]: Start difference. First operand 4359 states and 6532 transitions. Second operand has 4 states, 4 states have (on average 279.5) internal successors, (1118), 4 states have internal predecessors, (1118), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-11 23:13:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:13:35,715 INFO L93 Difference]: Finished difference Result 4363 states and 6536 transitions. [2024-11-11 23:13:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:13:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 279.5) internal successors, (1118), 4 states have internal predecessors, (1118), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 1165 [2024-11-11 23:13:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:13:35,735 INFO L225 Difference]: With dead ends: 4363 [2024-11-11 23:13:35,735 INFO L226 Difference]: Without dead ends: 4361 [2024-11-11 23:13:35,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:13:35,739 INFO L435 NwaCegarLoop]: 6530 mSDtfsCounter, 0 mSDsluCounter, 13054 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:13:35,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:13:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2024-11-11 23:13:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 4361. [2024-11-11 23:13:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4361 states, 4349 states have (on average 1.4978155897907566) internal successors, (6514), 4349 states have internal predecessors, (6514), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 23:13:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 4361 states and 6534 transitions. [2024-11-11 23:13:35,833 INFO L78 Accepts]: Start accepts. Automaton has 4361 states and 6534 transitions. Word has length 1165 [2024-11-11 23:13:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:13:35,837 INFO L471 AbstractCegarLoop]: Abstraction has 4361 states and 6534 transitions. [2024-11-11 23:13:35,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 279.5) internal successors, (1118), 4 states have internal predecessors, (1118), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-11 23:13:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4361 states and 6534 transitions. [2024-11-11 23:13:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2024-11-11 23:13:35,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:13:35,852 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:13:35,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 23:13:35,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:13:35,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:13:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -591179076, now seen corresponding path program 1 times [2024-11-11 23:13:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:13:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660548762] [2024-11-11 23:13:35,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:13:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:13:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-11 23:13:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-11 23:13:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-11 23:13:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-11 23:13:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-11-11 23:13:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-11-11 23:13:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-11-11 23:13:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-11-11 23:13:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-11 23:13:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2024-11-11 23:13:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-11 23:13:39,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:13:39,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660548762] [2024-11-11 23:13:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660548762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:13:39,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:13:39,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:13:39,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146404991] [2024-11-11 23:13:39,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:13:39,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:13:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:13:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:13:39,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:13:39,944 INFO L87 Difference]: Start difference. First operand 4361 states and 6534 transitions. Second operand has 5 states, 5 states have (on average 223.8) internal successors, (1119), 5 states have internal predecessors, (1119), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 23:13:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:13:42,388 INFO L93 Difference]: Finished difference Result 10899 states and 16333 transitions. [2024-11-11 23:13:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:13:42,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 223.8) internal successors, (1119), 5 states have internal predecessors, (1119), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 1166 [2024-11-11 23:13:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:13:42,409 INFO L225 Difference]: With dead ends: 10899 [2024-11-11 23:13:42,410 INFO L226 Difference]: Without dead ends: 4361 [2024-11-11 23:13:42,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:13:42,423 INFO L435 NwaCegarLoop]: 10436 mSDtfsCounter, 9722 mSDsluCounter, 15705 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9728 SdHoareTripleChecker+Valid, 26141 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:13:42,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9728 Valid, 26141 Invalid, 2120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [256 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 23:13:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2024-11-11 23:13:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 4361. [2024-11-11 23:13:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4361 states, 4349 states have (on average 1.497585651873994) internal successors, (6513), 4349 states have internal predecessors, (6513), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 23:13:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 4361 states and 6533 transitions. [2024-11-11 23:13:42,536 INFO L78 Accepts]: Start accepts. Automaton has 4361 states and 6533 transitions. Word has length 1166 [2024-11-11 23:13:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:13:42,537 INFO L471 AbstractCegarLoop]: Abstraction has 4361 states and 6533 transitions. [2024-11-11 23:13:42,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.8) internal successors, (1119), 5 states have internal predecessors, (1119), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 23:13:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4361 states and 6533 transitions. [2024-11-11 23:13:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2024-11-11 23:13:42,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:13:42,553 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:13:42,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 23:13:42,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:13:42,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:13:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2112041651, now seen corresponding path program 1 times [2024-11-11 23:13:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:13:42,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199131920] [2024-11-11 23:13:42,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:13:42,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:13:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-11 23:13:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-11 23:13:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-11 23:13:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-11 23:13:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-11-11 23:13:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-11 23:13:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2024-11-11 23:13:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-11-11 23:13:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2024-11-11 23:13:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-11-11 23:13:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-11 23:13:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:13:46,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199131920] [2024-11-11 23:13:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199131920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:13:46,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:13:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:13:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625164048] [2024-11-11 23:13:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:13:46,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:13:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:13:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:13:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:13:46,979 INFO L87 Difference]: Start difference. First operand 4361 states and 6533 transitions. Second operand has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 23:13:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:13:49,045 INFO L93 Difference]: Finished difference Result 7884 states and 11810 transitions. [2024-11-11 23:13:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:13:49,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 1167 [2024-11-11 23:13:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:13:49,062 INFO L225 Difference]: With dead ends: 7884 [2024-11-11 23:13:49,063 INFO L226 Difference]: Without dead ends: 4361 [2024-11-11 23:13:49,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:13:49,074 INFO L435 NwaCegarLoop]: 5247 mSDtfsCounter, 12413 mSDsluCounter, 5249 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12417 SdHoareTripleChecker+Valid, 10496 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 23:13:49,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12417 Valid, 10496 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 23:13:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2024-11-11 23:13:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 4361. [2024-11-11 23:13:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4361 states, 4349 states have (on average 1.4973557139572315) internal successors, (6512), 4349 states have internal predecessors, (6512), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 23:13:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 4361 states and 6532 transitions. [2024-11-11 23:13:49,172 INFO L78 Accepts]: Start accepts. Automaton has 4361 states and 6532 transitions. Word has length 1167 [2024-11-11 23:13:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:13:49,173 INFO L471 AbstractCegarLoop]: Abstraction has 4361 states and 6532 transitions. [2024-11-11 23:13:49,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 23:13:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4361 states and 6532 transitions. [2024-11-11 23:13:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2024-11-11 23:13:49,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:13:49,188 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:13:49,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 23:13:49,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:13:49,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:13:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash 72255231, now seen corresponding path program 1 times [2024-11-11 23:13:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:13:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667770779] [2024-11-11 23:13:49,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:13:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:13:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-11 23:13:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-11 23:13:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-11 23:13:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-11 23:13:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-11-11 23:13:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-11 23:13:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2024-11-11 23:13:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-11-11 23:13:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2024-11-11 23:13:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-11-11 23:13:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:13:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-11 23:13:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:13:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667770779] [2024-11-11 23:13:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667770779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:13:52,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:13:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:13:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089939702] [2024-11-11 23:13:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:13:52,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:13:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:13:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:13:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:13:52,632 INFO L87 Difference]: Start difference. First operand 4361 states and 6532 transitions. Second operand has 5 states, 5 states have (on average 224.2) internal successors, (1121), 5 states have internal predecessors, (1121), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)