./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.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/loops-crafted-1/nested3-1_abstracted.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 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:57:16,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:57:16,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:57:16,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:57:16,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:57:16,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:57:16,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:57:16,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:57:16,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:57:16,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:57:16,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:57:16,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:57:16,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:57:16,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:57:16,368 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:57:16,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:57:16,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:57:16,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:57:16,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:57:16,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:57:16,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:57:16,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:57:16,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:57:16,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:57:16,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:57:16,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:57:16,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:57:16,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:57:16,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:57:16,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:57:16,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:57:16,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:57:16,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:57:16,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:57:16,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:57:16,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:57:16,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:57:16,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:57:16,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:57:16,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:57:16,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:57:16,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:57:16,380 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 -> 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f [2024-10-11 01:57:16,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:57:16,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:57:16,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:57:16,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:57:16,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:57:16,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2024-10-11 01:57:18,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:57:18,279 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:57:18,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2024-10-11 01:57:18,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff81769b2/49ffd46f83a8420fb4024e19253e0de6/FLAGaea45dbc0 [2024-10-11 01:57:18,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff81769b2/49ffd46f83a8420fb4024e19253e0de6 [2024-10-11 01:57:18,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:57:18,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:57:18,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:57:18,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:57:18,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:57:18,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38444ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18, skipping insertion in model container [2024-10-11 01:57:18,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:57:18,500 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/loops-crafted-1/nested3-1_abstracted.c[739,752] [2024-10-11 01:57:18,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:57:18,532 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:57:18,545 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/loops-crafted-1/nested3-1_abstracted.c[739,752] [2024-10-11 01:57:18,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:57:18,571 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:57:18,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18 WrapperNode [2024-10-11 01:57:18,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:57:18,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:57:18,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:57:18,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:57:18,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,605 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-10-11 01:57:18,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:57:18,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:57:18,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:57:18,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:57:18,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,635 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 01:57:18,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:57:18,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:57:18,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:57:18,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:57:18,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (1/1) ... [2024-10-11 01:57:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:57:18,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:18,688 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 01:57:18,690 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 01:57:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:57:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:57:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:57:18,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:57:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 01:57:18,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 01:57:18,781 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:57:18,783 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:57:18,941 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-11 01:57:18,942 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:57:18,959 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:57:18,959 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 01:57:18,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:57:18 BoogieIcfgContainer [2024-10-11 01:57:18,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:57:18,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:57:18,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:57:18,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:57:18,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:57:18" (1/3) ... [2024-10-11 01:57:18,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607a92ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:57:18, skipping insertion in model container [2024-10-11 01:57:18,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:18" (2/3) ... [2024-10-11 01:57:18,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607a92ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:57:18, skipping insertion in model container [2024-10-11 01:57:18,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:57:18" (3/3) ... [2024-10-11 01:57:18,971 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3-1_abstracted.c [2024-10-11 01:57:18,986 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:57:18,986 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:57:19,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:57:19,044 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;@36002313, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:57:19,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:57:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:57:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:57:19,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:19,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:57:19,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1123149221, now seen corresponding path program 1 times [2024-10-11 01:57:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:19,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487757186] [2024-10-11 01:57:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:19,209 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 01:57:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487757186] [2024-10-11 01:57:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487757186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:57:19,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:57:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:57:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215868671] [2024-10-11 01:57:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:57:19,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:57:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:57:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:57:19,248 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:19,281 INFO L93 Difference]: Finished difference Result 39 states and 62 transitions. [2024-10-11 01:57:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:57:19,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:57:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:19,299 INFO L225 Difference]: With dead ends: 39 [2024-10-11 01:57:19,300 INFO L226 Difference]: Without dead ends: 18 [2024-10-11 01:57:19,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:57:19,310 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:19,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:57:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-11 01:57:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-11 01:57:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-10-11 01:57:19,349 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 6 [2024-10-11 01:57:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:19,350 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-11 01:57:19,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-10-11 01:57:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:57:19,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:19,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:57:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:57:19,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:19,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1163784145, now seen corresponding path program 1 times [2024-10-11 01:57:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:19,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133047872] [2024-10-11 01:57:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:19,466 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 01:57:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:19,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133047872] [2024-10-11 01:57:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133047872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:57:19,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:57:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:57:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181498279] [2024-10-11 01:57:19,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:57:19,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:57:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:57:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:57:19,470 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:19,490 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-10-11 01:57:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:57:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:57:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:19,491 INFO L225 Difference]: With dead ends: 35 [2024-10-11 01:57:19,491 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:57:19,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:57:19,493 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:19,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:57:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:57:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2024-10-11 01:57:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-10-11 01:57:19,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 6 [2024-10-11 01:57:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:19,503 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-11 01:57:19,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-10-11 01:57:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 01:57:19,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:19,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:57:19,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:57:19,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:19,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1712568119, now seen corresponding path program 1 times [2024-10-11 01:57:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025701878] [2024-10-11 01:57:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:19,581 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 01:57:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:19,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025701878] [2024-10-11 01:57:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025701878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:57:19,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:57:19,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:57:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613940135] [2024-10-11 01:57:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:57:19,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:57:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:57:19,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:57:19,589 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:19,615 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-10-11 01:57:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:57:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 01:57:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:19,619 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:57:19,620 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:57:19,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:57:19,622 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:19,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:57:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:57:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-10-11 01:57:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-10-11 01:57:19,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 7 [2024-10-11 01:57:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:19,628 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-11 01:57:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-10-11 01:57:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 01:57:19,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:19,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:57:19,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:57:19,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:19,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1520126644, now seen corresponding path program 1 times [2024-10-11 01:57:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:19,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881005233] [2024-10-11 01:57:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:19,731 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 01:57:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881005233] [2024-10-11 01:57:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881005233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:57:19,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:57:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:57:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426765400] [2024-10-11 01:57:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:57:19,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:57:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:57:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:57:19,734 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:19,749 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-11 01:57:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:57:19,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 01:57:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:19,751 INFO L225 Difference]: With dead ends: 38 [2024-10-11 01:57:19,751 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 01:57:19,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:57:19,752 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:19,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:57:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 01:57:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 01:57:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 01:57:19,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 8 [2024-10-11 01:57:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:19,758 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 01:57:19,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 01:57:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 01:57:19,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:19,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:57:19,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:57:19,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -784722118, now seen corresponding path program 1 times [2024-10-11 01:57:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856341706] [2024-10-11 01:57:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:19,995 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 01:57:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:19,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856341706] [2024-10-11 01:57:19,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856341706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:57:19,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:57:19,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:57:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105809884] [2024-10-11 01:57:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:57:19,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:57:19,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:19,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:57:19,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:57:19,998 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:20,111 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-11 01:57:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:57:20,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 01:57:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:20,113 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:57:20,113 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 01:57:20,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:57:20,114 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:20,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:57:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 01:57:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-11 01:57:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-11 01:57:20,122 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2024-10-11 01:57:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:20,122 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-11 01:57:20,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:57:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-11 01:57:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:57:20,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:20,123 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:57:20,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:57:20,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:20,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 447583495, now seen corresponding path program 1 times [2024-10-11 01:57:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384942287] [2024-10-11 01:57:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:57:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:57:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384942287] [2024-10-11 01:57:20,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384942287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:57:20,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005066070] [2024-10-11 01:57:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:20,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:20,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:20,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:57:20,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:57:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:20,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:57:20,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:57:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:57:20,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:57:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:57:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005066070] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:57:20,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:57:20,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2024-10-11 01:57:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784602555] [2024-10-11 01:57:20,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:57:20,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:57:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:20,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:57:20,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:57:20,486 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:20,637 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2024-10-11 01:57:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:57:20,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-11 01:57:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:20,639 INFO L225 Difference]: With dead ends: 74 [2024-10-11 01:57:20,640 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 01:57:20,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:57:20,641 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:20,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:57:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 01:57:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2024-10-11 01:57:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:57:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-10-11 01:57:20,660 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2024-10-11 01:57:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:20,661 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-10-11 01:57:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-10-11 01:57:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:57:20,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:20,663 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 01:57:20,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:57:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:20,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash -513092087, now seen corresponding path program 2 times [2024-10-11 01:57:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:20,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822931590] [2024-10-11 01:57:20,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:57:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:57:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:57:20,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822931590] [2024-10-11 01:57:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822931590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:57:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524819080] [2024-10-11 01:57:20,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:57:20,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:20,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:20,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:57:20,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:57:21,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:57:21,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:57:21,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 01:57:21,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:57:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:57:21,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:57:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:57:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524819080] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:57:21,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:57:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-11 01:57:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112933727] [2024-10-11 01:57:21,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:57:21,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 01:57:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 01:57:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:57:21,176 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 01:57:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:21,277 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2024-10-11 01:57:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:57:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2024-10-11 01:57:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:21,281 INFO L225 Difference]: With dead ends: 112 [2024-10-11 01:57:21,281 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 01:57:21,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:57:21,284 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:21,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:57:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 01:57:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 01:57:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 59 states have internal predecessors, (61), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 01:57:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-10-11 01:57:21,306 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 29 [2024-10-11 01:57:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:21,307 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-10-11 01:57:21,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 01:57:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-10-11 01:57:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 01:57:21,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:21,311 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-10-11 01:57:21,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:57:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:21,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -368598903, now seen corresponding path program 3 times [2024-10-11 01:57:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:21,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263373292] [2024-10-11 01:57:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:57:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:57:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 01:57:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 01:57:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 01:57:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 01:57:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 01:57:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:21,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263373292] [2024-10-11 01:57:21,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263373292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:57:21,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873367349] [2024-10-11 01:57:21,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:57:21,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:21,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:57:21,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:57:21,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 01:57:21,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:57:21,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:57:21,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:57:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-11 01:57:22,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:57:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873367349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:57:22,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:57:22,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-10-11 01:57:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244242923] [2024-10-11 01:57:22,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:57:22,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:57:22,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:57:22,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:57:22,075 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:22,212 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-10-11 01:57:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:57:22,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2024-10-11 01:57:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:22,214 INFO L225 Difference]: With dead ends: 77 [2024-10-11 01:57:22,214 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 01:57:22,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-11 01:57:22,215 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:22,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:57:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 01:57:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2024-10-11 01:57:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 01:57:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-11 01:57:22,235 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 73 [2024-10-11 01:57:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:22,236 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-11 01:57:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:57:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-11 01:57:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 01:57:22,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:22,240 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:57:22,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:57:22,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:22,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:22,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash -224949334, now seen corresponding path program 1 times [2024-10-11 01:57:22,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:22,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754811091] [2024-10-11 01:57:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:22,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:57:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:57:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 01:57:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 01:57:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 01:57:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 01:57:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 01:57:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 15 proven. 111 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 01:57:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754811091] [2024-10-11 01:57:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754811091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:57:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570406433] [2024-10-11 01:57:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:22,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:22,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:22,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:57:22,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:57:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:22,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:57:22,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:57:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-11 01:57:22,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:57:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-11 01:57:23,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570406433] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:57:23,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:57:23,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2024-10-11 01:57:23,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559563671] [2024-10-11 01:57:23,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:57:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 01:57:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:23,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 01:57:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:57:23,131 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 01:57:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:23,881 INFO L93 Difference]: Finished difference Result 310 states and 361 transitions. [2024-10-11 01:57:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 01:57:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 80 [2024-10-11 01:57:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:23,885 INFO L225 Difference]: With dead ends: 310 [2024-10-11 01:57:23,885 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 01:57:23,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 01:57:23,887 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 226 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:23,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 639 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:57:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 01:57:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 227. [2024-10-11 01:57:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 33 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 01:57:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2024-10-11 01:57:23,948 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 80 [2024-10-11 01:57:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:23,949 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2024-10-11 01:57:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 01:57:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2024-10-11 01:57:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-11 01:57:23,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:23,958 INFO L215 NwaCegarLoop]: trace histogram [33, 32, 32, 28, 28, 28, 28, 28, 28, 28, 28, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-10-11 01:57:23,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 01:57:24,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 01:57:24,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:24,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1691523183, now seen corresponding path program 2 times [2024-10-11 01:57:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836292388] [2024-10-11 01:57:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:57:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:57:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 01:57:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 01:57:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 01:57:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 01:57:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 01:57:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 01:57:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 01:57:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 01:57:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 01:57:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 01:57:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 01:57:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 01:57:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 01:57:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 01:57:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 01:57:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 01:57:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 01:57:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 01:57:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 01:57:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 01:57:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-11 01:57:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-11 01:57:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-11 01:57:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-11 01:57:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 01:57:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-10-11 01:57:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-10-11 01:57:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 01:57:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-10-11 01:57:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-10-11 01:57:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 1142 proven. 154 refuted. 0 times theorem prover too weak. 3538 trivial. 0 not checked. [2024-10-11 01:57:24,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836292388] [2024-10-11 01:57:24,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836292388] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:57:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156183338] [2024-10-11 01:57:24,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:57:24,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:24,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:57:24,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:57:24,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:57:24,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:57:24,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 01:57:25,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:57:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 64 proven. 2303 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2024-10-11 01:57:25,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:57:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4834 backedges. 151 proven. 2216 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2024-10-11 01:57:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156183338] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:57:26,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:57:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2024-10-11 01:57:26,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566874143] [2024-10-11 01:57:26,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:57:26,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 01:57:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 01:57:26,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2024-10-11 01:57:26,478 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand has 30 states, 30 states have (on average 6.233333333333333) internal successors, (187), 30 states have internal predecessors, (187), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2024-10-11 01:57:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:29,734 INFO L93 Difference]: Finished difference Result 850 states and 1000 transitions. [2024-10-11 01:57:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-11 01:57:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.233333333333333) internal successors, (187), 30 states have internal predecessors, (187), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) Word has length 346 [2024-10-11 01:57:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:29,739 INFO L225 Difference]: With dead ends: 850 [2024-10-11 01:57:29,739 INFO L226 Difference]: Without dead ends: 675 [2024-10-11 01:57:29,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4341 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2157, Invalid=10499, Unknown=0, NotChecked=0, Total=12656 [2024-10-11 01:57:29,745 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 396 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:29,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 2724 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 01:57:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-11 01:57:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 615. [2024-10-11 01:57:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 521 states have (on average 1.021113243761996) internal successors, (532), 521 states have internal predecessors, (532), 91 states have call successors, (91), 3 states have call predecessors, (91), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 01:57:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 713 transitions. [2024-10-11 01:57:29,837 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 713 transitions. Word has length 346 [2024-10-11 01:57:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:29,838 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 713 transitions. [2024-10-11 01:57:29,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.233333333333333) internal successors, (187), 30 states have internal predecessors, (187), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2024-10-11 01:57:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 713 transitions. [2024-10-11 01:57:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2024-10-11 01:57:29,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:29,877 INFO L215 NwaCegarLoop]: trace histogram [91, 90, 90, 80, 80, 80, 80, 80, 80, 80, 80, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-11 01:57:29,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 01:57:30,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 01:57:30,082 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:30,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1022671485, now seen corresponding path program 3 times [2024-10-11 01:57:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776641274] [2024-10-11 01:57:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:57:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:57:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 01:57:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 01:57:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 01:57:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 01:57:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 01:57:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 01:57:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 01:57:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 01:57:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 01:57:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 01:57:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 01:57:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 01:57:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 01:57:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 01:57:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 01:57:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 01:57:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 01:57:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 01:57:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 01:57:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 01:57:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-11 01:57:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 01:57:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 01:57:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-11 01:57:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-11 01:57:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-10-11 01:57:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-10-11 01:57:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 01:57:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-10-11 01:57:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-10-11 01:57:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-10-11 01:57:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-10-11 01:57:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-10-11 01:57:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-10-11 01:57:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2024-10-11 01:57:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-10-11 01:57:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-10-11 01:57:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-10-11 01:57:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 435 [2024-10-11 01:57:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2024-10-11 01:57:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-10-11 01:57:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 468 [2024-10-11 01:57:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2024-10-11 01:57:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2024-10-11 01:57:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-10-11 01:57:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-10-11 01:57:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 520 [2024-10-11 01:57:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 531 [2024-10-11 01:57:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 542 [2024-10-11 01:57:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 553 [2024-10-11 01:57:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-10-11 01:57:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2024-10-11 01:57:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 583 [2024-10-11 01:57:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 594 [2024-10-11 01:57:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 605 [2024-10-11 01:57:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 616 [2024-10-11 01:57:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 627 [2024-10-11 01:57:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 638 [2024-10-11 01:57:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 649 [2024-10-11 01:57:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 660 [2024-10-11 01:57:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 667 [2024-10-11 01:57:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 679 [2024-10-11 01:57:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-10-11 01:57:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 701 [2024-10-11 01:57:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 712 [2024-10-11 01:57:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2024-10-11 01:57:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2024-10-11 01:57:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2024-10-11 01:57:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2024-10-11 01:57:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 763 [2024-10-11 01:57:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-10-11 01:57:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 786 [2024-10-11 01:57:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 797 [2024-10-11 01:57:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 808 [2024-10-11 01:57:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2024-10-11 01:57:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 830 [2024-10-11 01:57:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 841 [2024-10-11 01:57:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 852 [2024-10-11 01:57:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2024-10-11 01:57:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 871 [2024-10-11 01:57:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 882 [2024-10-11 01:57:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 893 [2024-10-11 01:57:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 904 [2024-10-11 01:57:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 915 [2024-10-11 01:57:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 926 [2024-10-11 01:57:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 937 [2024-10-11 01:57:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 948 [2024-10-11 01:57:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 955 [2024-10-11 01:57:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4375 proven. 204 refuted. 0 times theorem prover too weak. 34731 trivial. 0 not checked. [2024-10-11 01:57:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776641274] [2024-10-11 01:57:31,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776641274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:57:31,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021569259] [2024-10-11 01:57:31,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:57:31,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:31,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:31,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:57:31,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:57:32,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 01:57:32,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:57:32,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:57:32,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:57:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4747 proven. 204 refuted. 0 times theorem prover too weak. 34359 trivial. 0 not checked. [2024-10-11 01:57:32,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:57:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 39310 backedges. 4393 proven. 204 refuted. 0 times theorem prover too weak. 34713 trivial. 0 not checked. [2024-10-11 01:57:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021569259] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:57:32,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:57:32,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-10-11 01:57:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899298387] [2024-10-11 01:57:32,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:57:32,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 01:57:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 01:57:32,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-10-11 01:57:32,740 INFO L87 Difference]: Start difference. First operand 615 states and 713 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 states have internal predecessors, (130), 18 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-11 01:57:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:57:33,883 INFO L93 Difference]: Finished difference Result 1871 states and 2258 transitions. [2024-10-11 01:57:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 01:57:33,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 states have internal predecessors, (130), 18 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) Word has length 966 [2024-10-11 01:57:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:57:33,892 INFO L225 Difference]: With dead ends: 1871 [2024-10-11 01:57:33,893 INFO L226 Difference]: Without dead ends: 1315 [2024-10-11 01:57:33,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2130 GetRequests, 2103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2024-10-11 01:57:33,896 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 55 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:57:33,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 599 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:57:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-10-11 01:57:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2024-10-11 01:57:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1121 states have (on average 1.0098126672613739) internal successors, (1132), 1121 states have internal predecessors, (1132), 191 states have call successors, (191), 3 states have call predecessors, (191), 2 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 01:57:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1513 transitions. [2024-10-11 01:57:34,078 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1513 transitions. Word has length 966 [2024-10-11 01:57:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:57:34,079 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1513 transitions. [2024-10-11 01:57:34,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 states have internal predecessors, (130), 18 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-11 01:57:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1513 transitions. [2024-10-11 01:57:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2067 [2024-10-11 01:57:34,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:57:34,175 INFO L215 NwaCegarLoop]: trace histogram [191, 190, 190, 180, 180, 180, 180, 180, 180, 180, 180, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-11 01:57:34,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 01:57:34,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 01:57:34,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:57:34,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:57:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -570458691, now seen corresponding path program 4 times [2024-10-11 01:57:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:57:34,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555317570] [2024-10-11 01:57:34,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:57:34,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:57:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:57:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:57:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 01:57:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 01:57:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 01:57:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 01:57:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 01:57:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 01:57:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 01:57:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 01:57:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 01:57:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 01:57:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 01:57:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 01:57:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 01:57:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 01:57:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 01:57:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 01:57:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 01:57:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 01:57:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-11 01:57:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-11 01:57:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 01:57:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 01:57:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 01:57:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-11 01:57:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-11 01:57:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-10-11 01:57:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-11 01:57:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-10-11 01:57:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-10-11 01:57:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 01:57:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 01:57:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-10-11 01:57:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-10-11 01:57:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2024-10-11 01:57:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-10-11 01:57:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-10-11 01:57:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-10-11 01:57:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2024-10-11 01:57:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-10-11 01:57:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-10-11 01:57:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 463 [2024-10-11 01:57:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2024-10-11 01:57:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2024-10-11 01:57:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496 [2024-10-11 01:57:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2024-10-11 01:57:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2024-10-11 01:57:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 529 [2024-10-11 01:57:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-10-11 01:57:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2024-10-11 01:57:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 562 [2024-10-11 01:57:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 573 [2024-10-11 01:57:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2024-10-11 01:57:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-10-11 01:57:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 606 [2024-10-11 01:57:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 613 [2024-10-11 01:57:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 625 [2024-10-11 01:57:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2024-10-11 01:57:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-10-11 01:57:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2024-10-11 01:57:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 669 [2024-10-11 01:57:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-10-11 01:57:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 691 [2024-10-11 01:57:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 702 [2024-10-11 01:57:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2024-10-11 01:57:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 724 [2024-10-11 01:57:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 735 [2024-10-11 01:57:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 746 [2024-10-11 01:57:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 757 [2024-10-11 01:57:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 768 [2024-10-11 01:57:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 779 [2024-10-11 01:57:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 790 [2024-10-11 01:57:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 801 [2024-10-11 01:57:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 812 [2024-10-11 01:57:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2024-10-11 01:57:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 831 [2024-10-11 01:57:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-10-11 01:57:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 853 [2024-10-11 01:57:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 864 [2024-10-11 01:57:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2024-10-11 01:57:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 886 [2024-10-11 01:57:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 897 [2024-10-11 01:57:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 908 [2024-10-11 01:57:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 919 [2024-10-11 01:57:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2024-10-11 01:57:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 941 [2024-10-11 01:57:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 952 [2024-10-11 01:57:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 963 [2024-10-11 01:57:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 974 [2024-10-11 01:57:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 985 [2024-10-11 01:57:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 996 [2024-10-11 01:57:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1007 [2024-10-11 01:57:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1018 [2024-10-11 01:57:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1025 [2024-10-11 01:57:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1037 [2024-10-11 01:57:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1048 [2024-10-11 01:57:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1059 [2024-10-11 01:57:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1070 [2024-10-11 01:57:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1081 [2024-10-11 01:57:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1092 [2024-10-11 01:57:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1103 [2024-10-11 01:57:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:39,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1114 [2024-10-11 01:57:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1125 [2024-10-11 01:57:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1136 [2024-10-11 01:57:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1147 [2024-10-11 01:57:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1158 [2024-10-11 01:57:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1169 [2024-10-11 01:57:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1180 [2024-10-11 01:57:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1191 [2024-10-11 01:57:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1202 [2024-10-11 01:57:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1213 [2024-10-11 01:57:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1224 [2024-10-11 01:57:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1231 [2024-10-11 01:57:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1243 [2024-10-11 01:57:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1254 [2024-10-11 01:57:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1265 [2024-10-11 01:57:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1276 [2024-10-11 01:57:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1287 [2024-10-11 01:57:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1298 [2024-10-11 01:57:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1309 [2024-10-11 01:57:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1320 [2024-10-11 01:57:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1331 [2024-10-11 01:57:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1342 [2024-10-11 01:57:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1353 [2024-10-11 01:57:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1364 [2024-10-11 01:57:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1375 [2024-10-11 01:57:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1386 [2024-10-11 01:57:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1397 [2024-10-11 01:57:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1408 [2024-10-11 01:57:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1419 [2024-10-11 01:57:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1430 [2024-10-11 01:57:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1437 [2024-10-11 01:57:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1449 [2024-10-11 01:57:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1460 [2024-10-11 01:57:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1471 [2024-10-11 01:57:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1482 [2024-10-11 01:57:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1493 [2024-10-11 01:57:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1504 [2024-10-11 01:57:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1515 [2024-10-11 01:57:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1526 [2024-10-11 01:57:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1537 [2024-10-11 01:57:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1548 [2024-10-11 01:57:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1559 [2024-10-11 01:57:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1570 [2024-10-11 01:57:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1581 [2024-10-11 01:57:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1592 [2024-10-11 01:57:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1603 [2024-10-11 01:57:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1614 [2024-10-11 01:57:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1625 [2024-10-11 01:57:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1636 [2024-10-11 01:57:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1643 [2024-10-11 01:57:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1655 [2024-10-11 01:57:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1666 [2024-10-11 01:57:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1677 [2024-10-11 01:57:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1688 [2024-10-11 01:57:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1699 [2024-10-11 01:57:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1710 [2024-10-11 01:57:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1721 [2024-10-11 01:57:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1732 [2024-10-11 01:57:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1743 [2024-10-11 01:57:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1754 [2024-10-11 01:57:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1765 [2024-10-11 01:57:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1776 [2024-10-11 01:57:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1787 [2024-10-11 01:57:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1798 [2024-10-11 01:57:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1809 [2024-10-11 01:57:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1820 [2024-10-11 01:57:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1831 [2024-10-11 01:57:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1842 [2024-10-11 01:57:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1849 [2024-10-11 01:57:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1861 [2024-10-11 01:57:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1872 [2024-10-11 01:57:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1883 [2024-10-11 01:57:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1894 [2024-10-11 01:57:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1905 [2024-10-11 01:57:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1916 [2024-10-11 01:57:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1927 [2024-10-11 01:57:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1938 [2024-10-11 01:57:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1949 [2024-10-11 01:57:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1960 [2024-10-11 01:57:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1971 [2024-10-11 01:57:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1982 [2024-10-11 01:57:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1993 [2024-10-11 01:57:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2004 [2024-10-11 01:57:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2015 [2024-10-11 01:57:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2026 [2024-10-11 01:57:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2037 [2024-10-11 01:57:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2048 [2024-10-11 01:57:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2055 [2024-10-11 01:57:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:57:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 21135 proven. 1089 refuted. 0 times theorem prover too weak. 164736 trivial. 0 not checked. [2024-10-11 01:57:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:57:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555317570] [2024-10-11 01:57:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555317570] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:57:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773604388] [2024-10-11 01:57:40,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 01:57:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:57:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:57:40,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:57:40,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 01:57:40,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 01:57:40,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:57:40,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 3783 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 01:57:40,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:57:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 380 proven. 104763 refuted. 0 times theorem prover too weak. 81817 trivial. 0 not checked. [2024-10-11 01:57:42,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:57:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 186960 backedges. 948 proven. 104195 refuted. 0 times theorem prover too weak. 81817 trivial. 0 not checked. [2024-10-11 01:57:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773604388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:57:46,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:57:46,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 65 [2024-10-11 01:57:46,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497175048] [2024-10-11 01:57:46,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:57:46,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-11 01:57:46,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:57:46,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-11 01:57:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=3487, Unknown=0, NotChecked=0, Total=4160 [2024-10-11 01:57:46,278 INFO L87 Difference]: Start difference. First operand 1315 states and 1513 transitions. Second operand has 65 states, 65 states have (on average 6.661538461538462) internal successors, (433), 65 states have internal predecessors, (433), 59 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (80), 59 states have call predecessors, (80), 59 states have call successors, (80)