./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:57,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:57,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:22:57,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:57,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:57,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:57,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:57,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:57,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:57,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:57,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:57,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:57,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:57,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:57,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:57,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:57,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:57,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:57,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:22:57,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:57,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:57,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:57,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:57,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:57,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:57,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:57,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:57,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:57,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:57,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:57,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:57,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:57,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:57,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:57,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:57,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:57,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:22:57,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:22:57,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:57,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:57,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:57,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:57,395 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2024-11-08 10:22:57,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:57,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:57,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:57,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:57,639 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:57,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2024-11-08 10:22:58,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:58,987 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:58,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2024-11-08 10:22:58,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6610aee85/1e36a084487348a6a148c95866a09176/FLAG42acd69c3 [2024-11-08 10:22:59,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6610aee85/1e36a084487348a6a148c95866a09176 [2024-11-08 10:22:59,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:59,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:59,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:59,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:59,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:59,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2599d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59, skipping insertion in model container [2024-11-08 10:22:59,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:59,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c[728,741] [2024-11-08 10:22:59,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:59,205 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:59,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c[728,741] [2024-11-08 10:22:59,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:59,264 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:59,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59 WrapperNode [2024-11-08 10:22:59,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:59,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:59,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:59,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:59,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,309 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 147 [2024-11-08 10:22:59,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:59,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:59,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:59,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:59,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,331 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:59,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:59,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:59,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:59,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:59,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (1/1) ... [2024-11-08 10:22:59,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:59,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:59,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:59,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:59,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:22:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-08 10:22:59,407 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-08 10:22:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:59,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 10:22:59,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 10:22:59,462 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:59,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:59,721 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:59,721 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:59,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:59,732 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 10:22:59,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:59 BoogieIcfgContainer [2024-11-08 10:22:59,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:59,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:59,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:59,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:59,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:59" (1/3) ... [2024-11-08 10:22:59,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@997ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:59, skipping insertion in model container [2024-11-08 10:22:59,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:59" (2/3) ... [2024-11-08 10:22:59,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@997ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:59, skipping insertion in model container [2024-11-08 10:22:59,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:59" (3/3) ... [2024-11-08 10:22:59,741 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2024-11-08 10:22:59,753 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:59,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:59,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:59,797 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;@534e2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:59,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 68 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 10:22:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 10:22:59,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:59,808 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:59,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:59,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1280901460, now seen corresponding path program 1 times [2024-11-08 10:22:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510271049] [2024-11-08 10:22:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:23:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:23:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 10:23:00,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510271049] [2024-11-08 10:23:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510271049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568471724] [2024-11-08 10:23:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:00,103 INFO L87 Difference]: Start difference. First operand has 75 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 68 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:00,164 INFO L93 Difference]: Finished difference Result 175 states and 269 transitions. [2024-11-08 10:23:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:00,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-08 10:23:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:00,173 INFO L225 Difference]: With dead ends: 175 [2024-11-08 10:23:00,174 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 10:23:00,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:00,182 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 203 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-11-08 10:23:00,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 10:23:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 10:23:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 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-11-08 10:23:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-11-08 10:23:00,214 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 42 [2024-11-08 10:23:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:00,215 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-11-08 10:23:00,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-11-08 10:23:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:23:00,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:00,217 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:00,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:23:00,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2080463270, now seen corresponding path program 1 times [2024-11-08 10:23:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:00,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527187953] [2024-11-08 10:23:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:23:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:23:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 10:23:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:00,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527187953] [2024-11-08 10:23:00,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527187953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:00,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:00,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230297328] [2024-11-08 10:23:00,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:00,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:00,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:00,377 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:00,397 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2024-11-08 10:23:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:00,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-08 10:23:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:00,401 INFO L225 Difference]: With dead ends: 106 [2024-11-08 10:23:00,401 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 10:23:00,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:00,403 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 283 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-11-08 10:23:00,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 283 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 10:23:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 10:23:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 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-11-08 10:23:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2024-11-08 10:23:00,411 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 44 [2024-11-08 10:23:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:00,411 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2024-11-08 10:23:00,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2024-11-08 10:23:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:23:00,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:00,413 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:23:00,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:00,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1493657256, now seen corresponding path program 1 times [2024-11-08 10:23:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8721207] [2024-11-08 10:23:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:23:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:23:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8721207] [2024-11-08 10:23:00,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8721207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:00,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583738237] [2024-11-08 10:23:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:00,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:00,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:00,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:00,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:23:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:00,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:23:00,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:23:00,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583738237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:00,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:00,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-08 10:23:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230491963] [2024-11-08 10:23:00,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:00,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:00,687 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:00,777 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2024-11-08 10:23:00,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:23:00,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2024-11-08 10:23:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:00,779 INFO L225 Difference]: With dead ends: 156 [2024-11-08 10:23:00,779 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 10:23:00,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:00,781 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 21 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:00,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 222 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 10:23:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-11-08 10:23:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 10:23:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-08 10:23:00,800 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 44 [2024-11-08 10:23:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:00,800 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-08 10:23:00,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-08 10:23:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 10:23:00,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:00,801 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:00,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:23:01,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:01,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:01,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash 417180924, now seen corresponding path program 1 times [2024-11-08 10:23:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:01,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978039156] [2024-11-08 10:23:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 10:23:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 10:23:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978039156] [2024-11-08 10:23:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978039156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:01,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256029575] [2024-11-08 10:23:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:01,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:01,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:01,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:01,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:23:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:01,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:23:01,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256029575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:01,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-08 10:23:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655229867] [2024-11-08 10:23:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:01,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:01,192 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:01,257 INFO L93 Difference]: Finished difference Result 172 states and 242 transitions. [2024-11-08 10:23:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-08 10:23:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:01,259 INFO L225 Difference]: With dead ends: 172 [2024-11-08 10:23:01,259 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 10:23:01,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:01,260 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 15 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:01,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 238 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 10:23:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2024-11-08 10:23:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:23:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-08 10:23:01,267 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 47 [2024-11-08 10:23:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:01,267 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-08 10:23:01,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-11-08 10:23:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:23:01,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:01,269 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:01,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:01,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 10:23:01,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:01,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1524103143, now seen corresponding path program 1 times [2024-11-08 10:23:01,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41764199] [2024-11-08 10:23:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:23:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 10:23:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:01,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41764199] [2024-11-08 10:23:01,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41764199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:01,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652965172] [2024-11-08 10:23:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:01,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:01,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:01,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:23:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:01,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:23:01,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:01,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652965172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:01,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:01,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-08 10:23:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302886021] [2024-11-08 10:23:01,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:01,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:01,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:01,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:01,650 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:01,697 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2024-11-08 10:23:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:01,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-11-08 10:23:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:01,699 INFO L225 Difference]: With dead ends: 178 [2024-11-08 10:23:01,699 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 10:23:01,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:01,701 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:01,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 240 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 10:23:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-08 10:23:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 80 states have internal predecessors, (110), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:23:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2024-11-08 10:23:01,712 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 48 [2024-11-08 10:23:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:01,712 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2024-11-08 10:23:01,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2024-11-08 10:23:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:23:01,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:01,713 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:01,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:23:01,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:01,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1669508678, now seen corresponding path program 1 times [2024-11-08 10:23:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600944405] [2024-11-08 10:23:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 10:23:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 10:23:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:02,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:02,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600944405] [2024-11-08 10:23:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600944405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:02,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512574576] [2024-11-08 10:23:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:02,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:02,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:02,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:02,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:23:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:23:02,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:23:02,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512574576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:02,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-08 10:23:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276877113] [2024-11-08 10:23:02,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:02,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 10:23:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 10:23:02,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:23:02,203 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 10:23:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:02,293 INFO L93 Difference]: Finished difference Result 229 states and 330 transitions. [2024-11-08 10:23:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:23:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-11-08 10:23:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:02,294 INFO L225 Difference]: With dead ends: 229 [2024-11-08 10:23:02,294 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 10:23:02,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:23:02,295 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 116 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:02,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 375 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 10:23:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2024-11-08 10:23:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 94 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:23:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-11-08 10:23:02,308 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 50 [2024-11-08 10:23:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:02,308 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-11-08 10:23:02,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 10:23:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-11-08 10:23:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 10:23:02,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:02,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:02,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:23:02,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:02,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:02,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash 376667408, now seen corresponding path program 1 times [2024-11-08 10:23:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423853599] [2024-11-08 10:23:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:23:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 10:23:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423853599] [2024-11-08 10:23:02,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423853599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939576304] [2024-11-08 10:23:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:02,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:02,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:02,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:23:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:23:02,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:23:02,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939576304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:02,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-08 10:23:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589464293] [2024-11-08 10:23:02,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:02,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 10:23:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 10:23:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:23:02,804 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 10:23:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:02,902 INFO L93 Difference]: Finished difference Result 248 states and 362 transitions. [2024-11-08 10:23:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:23:02,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2024-11-08 10:23:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:02,904 INFO L225 Difference]: With dead ends: 248 [2024-11-08 10:23:02,904 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 10:23:02,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:23:02,908 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 132 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:02,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 481 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 10:23:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2024-11-08 10:23:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 102 states have (on average 1.4509803921568627) internal successors, (148), 103 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:23:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-08 10:23:02,915 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 51 [2024-11-08 10:23:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:02,915 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-08 10:23:02,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 10:23:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-08 10:23:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:23:02,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:02,916 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:02,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:23:03,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:03,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1690184016, now seen corresponding path program 1 times [2024-11-08 10:23:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:03,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193503322] [2024-11-08 10:23:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 10:23:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 10:23:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:03,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193503322] [2024-11-08 10:23:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193503322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168730823] [2024-11-08 10:23:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:03,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:03,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:03,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:03,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:23:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:23:03,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:23:03,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168730823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:03,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:03,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-08 10:23:03,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672759050] [2024-11-08 10:23:03,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:03,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:03,210 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:03,237 INFO L93 Difference]: Finished difference Result 224 states and 332 transitions. [2024-11-08 10:23:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:03,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-08 10:23:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:03,238 INFO L225 Difference]: With dead ends: 224 [2024-11-08 10:23:03,239 INFO L226 Difference]: Without dead ends: 120 [2024-11-08 10:23:03,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:03,239 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:03,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 172 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-08 10:23:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2024-11-08 10:23:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 104 states have (on average 1.4423076923076923) internal successors, (150), 105 states have internal predecessors, (150), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:23:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-08 10:23:03,251 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 52 [2024-11-08 10:23:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:03,252 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-08 10:23:03,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-08 10:23:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:23:03,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:03,253 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:03,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 10:23:03,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:03,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:03,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2138286388, now seen corresponding path program 1 times [2024-11-08 10:23:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106010239] [2024-11-08 10:23:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 10:23:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 10:23:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106010239] [2024-11-08 10:23:03,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106010239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846496560] [2024-11-08 10:23:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:03,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:03,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:03,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:23:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:23:03,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:23:03,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846496560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-08 10:23:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165124356] [2024-11-08 10:23:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:03,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:03,544 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:03,573 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2024-11-08 10:23:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:03,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-08 10:23:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:03,575 INFO L225 Difference]: With dead ends: 222 [2024-11-08 10:23:03,575 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 10:23:03,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:03,576 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:03,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 171 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 10:23:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2024-11-08 10:23:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:23:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-08 10:23:03,587 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 52 [2024-11-08 10:23:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:03,587 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-08 10:23:03,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-08 10:23:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 10:23:03,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:03,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:03,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 10:23:03,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:03,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:03,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -574027671, now seen corresponding path program 1 times [2024-11-08 10:23:03,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:03,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609695110] [2024-11-08 10:23:03,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:23:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 10:23:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609695110] [2024-11-08 10:23:03,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609695110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438764860] [2024-11-08 10:23:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:03,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:03,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:03,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:23:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 10:23:03,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:03,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438764860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:03,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:03,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-08 10:23:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134599570] [2024-11-08 10:23:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:03,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:23:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:23:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:23:03,988 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:04,050 INFO L93 Difference]: Finished difference Result 154 states and 217 transitions. [2024-11-08 10:23:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:23:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2024-11-08 10:23:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:04,051 INFO L225 Difference]: With dead ends: 154 [2024-11-08 10:23:04,051 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 10:23:04,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:23:04,052 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 39 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:04,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 525 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 10:23:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2024-11-08 10:23:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 139 states have internal predecessors, (192), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 10:23:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 210 transitions. [2024-11-08 10:23:04,058 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 210 transitions. Word has length 53 [2024-11-08 10:23:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:04,058 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 210 transitions. [2024-11-08 10:23:04,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 210 transitions. [2024-11-08 10:23:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:23:04,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:04,059 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:04,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 10:23:04,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 10:23:04,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:04,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1063288433, now seen corresponding path program 1 times [2024-11-08 10:23:04,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:04,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138550998] [2024-11-08 10:23:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:23:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 10:23:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138550998] [2024-11-08 10:23:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138550998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326665665] [2024-11-08 10:23:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:04,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:04,336 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:04,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 10:23:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 10:23:04,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:04,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326665665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2024-11-08 10:23:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34614862] [2024-11-08 10:23:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:04,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:23:04,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:23:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:23:04,452 INFO L87 Difference]: Start difference. First operand 148 states and 210 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:04,505 INFO L93 Difference]: Finished difference Result 196 states and 277 transitions. [2024-11-08 10:23:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:23:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-08 10:23:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:04,507 INFO L225 Difference]: With dead ends: 196 [2024-11-08 10:23:04,507 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 10:23:04,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:23:04,507 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:04,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 700 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 10:23:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2024-11-08 10:23:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 145 states have (on average 1.3793103448275863) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 10:23:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 224 transitions. [2024-11-08 10:23:04,513 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 224 transitions. Word has length 55 [2024-11-08 10:23:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:04,514 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 224 transitions. [2024-11-08 10:23:04,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 224 transitions. [2024-11-08 10:23:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:23:04,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:04,515 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:04,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 10:23:04,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:04,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:04,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash -805122995, now seen corresponding path program 1 times [2024-11-08 10:23:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172415294] [2024-11-08 10:23:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:23:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 10:23:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:04,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172415294] [2024-11-08 10:23:04,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172415294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:04,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811967797] [2024-11-08 10:23:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:04,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:04,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:04,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 10:23:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:23:04,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:23:04,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811967797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:04,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:04,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-08 10:23:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795593767] [2024-11-08 10:23:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:04,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:23:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:04,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:23:04,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:04,915 INFO L87 Difference]: Start difference. First operand 157 states and 224 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:04,980 INFO L93 Difference]: Finished difference Result 321 states and 461 transitions. [2024-11-08 10:23:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:04,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-08 10:23:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:04,982 INFO L225 Difference]: With dead ends: 321 [2024-11-08 10:23:04,982 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 10:23:04,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:23:04,983 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 21 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:04,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 256 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 10:23:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2024-11-08 10:23:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 147 states have internal predecessors, (201), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 10:23:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 225 transitions. [2024-11-08 10:23:04,992 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 225 transitions. Word has length 55 [2024-11-08 10:23:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:04,992 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 225 transitions. [2024-11-08 10:23:04,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 225 transitions. [2024-11-08 10:23:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:23:04,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:04,993 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:05,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:05,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 10:23:05,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2067975980, now seen corresponding path program 1 times [2024-11-08 10:23:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646811216] [2024-11-08 10:23:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:23:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 10:23:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:05,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:05,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646811216] [2024-11-08 10:23:05,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646811216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:05,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492690516] [2024-11-08 10:23:05,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:05,281 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:05,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 10:23:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:23:05,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:23:05,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:05,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492690516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:05,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:05,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:23:05,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316875786] [2024-11-08 10:23:05,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:05,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:05,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:05,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:05,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:23:05,374 INFO L87 Difference]: Start difference. First operand 158 states and 225 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:05,403 INFO L93 Difference]: Finished difference Result 313 states and 450 transitions. [2024-11-08 10:23:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-08 10:23:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:05,404 INFO L225 Difference]: With dead ends: 313 [2024-11-08 10:23:05,405 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 10:23:05,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:23:05,405 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:05,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 178 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 10:23:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2024-11-08 10:23:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 146 states have internal predecessors, (199), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 10:23:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 223 transitions. [2024-11-08 10:23:05,411 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 223 transitions. Word has length 55 [2024-11-08 10:23:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:05,411 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 223 transitions. [2024-11-08 10:23:05,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2024-11-08 10:23:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 10:23:05,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:05,412 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:05,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 10:23:05,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 10:23:05,613 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:05,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2085857113, now seen corresponding path program 1 times [2024-11-08 10:23:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:05,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509119804] [2024-11-08 10:23:05,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 10:23:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 10:23:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509119804] [2024-11-08 10:23:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509119804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987650517] [2024-11-08 10:23:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:05,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:05,684 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:05,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 10:23:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:23:05,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 10:23:05,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987650517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:05,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:05,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-08 10:23:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776282801] [2024-11-08 10:23:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:05,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:23:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:05,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:23:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:05,751 INFO L87 Difference]: Start difference. First operand 157 states and 223 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:05,773 INFO L93 Difference]: Finished difference Result 172 states and 239 transitions. [2024-11-08 10:23:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:23:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2024-11-08 10:23:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:05,774 INFO L225 Difference]: With dead ends: 172 [2024-11-08 10:23:05,774 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 10:23:05,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:05,775 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:05,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 10:23:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-08 10:23:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 155 states have internal predecessors, (209), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 10:23:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 233 transitions. [2024-11-08 10:23:05,781 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 233 transitions. Word has length 56 [2024-11-08 10:23:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:05,781 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 233 transitions. [2024-11-08 10:23:05,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 233 transitions. [2024-11-08 10:23:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 10:23:05,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:05,782 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:05,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:05,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 10:23:05,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:05,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2143115415, now seen corresponding path program 1 times [2024-11-08 10:23:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:05,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925284285] [2024-11-08 10:23:05,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 10:23:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 10:23:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 10:23:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:06,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925284285] [2024-11-08 10:23:06,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925284285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:06,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:06,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564841558] [2024-11-08 10:23:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:06,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:06,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:06,042 INFO L87 Difference]: Start difference. First operand 166 states and 233 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:06,060 INFO L93 Difference]: Finished difference Result 172 states and 238 transitions. [2024-11-08 10:23:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2024-11-08 10:23:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:06,061 INFO L225 Difference]: With dead ends: 172 [2024-11-08 10:23:06,061 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 10:23:06,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:06,062 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:06,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 458 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 10:23:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-08 10:23:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.3591549295774648) internal successors, (193), 144 states have internal predecessors, (193), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-08 10:23:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2024-11-08 10:23:06,067 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 56 [2024-11-08 10:23:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:06,067 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2024-11-08 10:23:06,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2024-11-08 10:23:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 10:23:06,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:06,068 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:06,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:23:06,068 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:06,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1741950426, now seen corresponding path program 1 times [2024-11-08 10:23:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:06,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649524342] [2024-11-08 10:23:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 10:23:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 10:23:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:23:06,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:06,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649524342] [2024-11-08 10:23:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649524342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:06,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109203961] [2024-11-08 10:23:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:06,152 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:06,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 10:23:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 10:23:06,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 10:23:06,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 10:23:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109203961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:06,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:06,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 11] total 22 [2024-11-08 10:23:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404412679] [2024-11-08 10:23:06,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:06,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 10:23:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:06,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 10:23:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-11-08 10:23:06,438 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 10:23:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:06,729 INFO L93 Difference]: Finished difference Result 326 states and 456 transitions. [2024-11-08 10:23:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 10:23:06,729 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) Word has length 58 [2024-11-08 10:23:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:06,730 INFO L225 Difference]: With dead ends: 326 [2024-11-08 10:23:06,730 INFO L226 Difference]: Without dead ends: 172 [2024-11-08 10:23:06,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2024-11-08 10:23:06,731 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 126 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:06,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1064 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:23:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-08 10:23:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 110. [2024-11-08 10:23:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.309278350515464) internal successors, (127), 101 states have internal predecessors, (127), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-08 10:23:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2024-11-08 10:23:06,738 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 58 [2024-11-08 10:23:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:06,738 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2024-11-08 10:23:06,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 10:23:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2024-11-08 10:23:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 10:23:06,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:06,739 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:06,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:23:06,943 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:06,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash 508824728, now seen corresponding path program 1 times [2024-11-08 10:23:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389972638] [2024-11-08 10:23:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 10:23:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 10:23:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 10:23:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389972638] [2024-11-08 10:23:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389972638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 10:23:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191961512] [2024-11-08 10:23:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:23:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:23:07,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:07,049 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:07,084 INFO L93 Difference]: Finished difference Result 151 states and 200 transitions. [2024-11-08 10:23:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:23:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2024-11-08 10:23:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:07,086 INFO L225 Difference]: With dead ends: 151 [2024-11-08 10:23:07,086 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 10:23:07,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:07,087 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:07,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 10:23:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2024-11-08 10:23:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 97 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-08 10:23:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2024-11-08 10:23:07,095 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 65 [2024-11-08 10:23:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:07,095 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2024-11-08 10:23:07,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2024-11-08 10:23:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 10:23:07,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:07,097 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:07,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 10:23:07,097 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:07,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash -359796564, now seen corresponding path program 1 times [2024-11-08 10:23:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548893993] [2024-11-08 10:23:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 10:23:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 10:23:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 10:23:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548893993] [2024-11-08 10:23:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548893993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037975630] [2024-11-08 10:23:07,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:07,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:07,240 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:07,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 10:23:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 10:23:07,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 10:23:07,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 10:23:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037975630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:07,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-08 10:23:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659380392] [2024-11-08 10:23:07,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:07,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 10:23:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 10:23:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:23:07,398 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 10:23:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:07,449 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2024-11-08 10:23:07,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:23:07,450 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2024-11-08 10:23:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:07,450 INFO L225 Difference]: With dead ends: 151 [2024-11-08 10:23:07,450 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 10:23:07,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:23:07,451 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:07,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 938 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 10:23:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 10:23:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 97 states have internal predecessors, (120), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:23:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-08 10:23:07,456 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 70 [2024-11-08 10:23:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:07,456 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-08 10:23:07,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 10:23:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-08 10:23:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 10:23:07,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:07,457 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:07,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 10:23:07,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:07,660 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:07,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -606537125, now seen corresponding path program 1 times [2024-11-08 10:23:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:07,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652245968] [2024-11-08 10:23:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 10:23:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 10:23:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652245968] [2024-11-08 10:23:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652245968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576000938] [2024-11-08 10:23:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:07,779 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:07,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 10:23:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 10:23:07,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 10:23:07,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 10:23:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576000938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:08,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:08,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 16 [2024-11-08 10:23:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661430500] [2024-11-08 10:23:08,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:08,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 10:23:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:08,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 10:23:08,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-08 10:23:08,024 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 10:23:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:08,245 INFO L93 Difference]: Finished difference Result 229 states and 291 transitions. [2024-11-08 10:23:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 10:23:08,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 74 [2024-11-08 10:23:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:08,246 INFO L225 Difference]: With dead ends: 229 [2024-11-08 10:23:08,247 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 10:23:08,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-08 10:23:08,247 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 30 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:08,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 677 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 10:23:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2024-11-08 10:23:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 103 states have internal predecessors, (127), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 10:23:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2024-11-08 10:23:08,253 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 74 [2024-11-08 10:23:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:08,253 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2024-11-08 10:23:08,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 10:23:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2024-11-08 10:23:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 10:23:08,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:08,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:08,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:08,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:08,455 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:08,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1376389855, now seen corresponding path program 1 times [2024-11-08 10:23:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804713873] [2024-11-08 10:23:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 10:23:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 10:23:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804713873] [2024-11-08 10:23:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804713873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683001492] [2024-11-08 10:23:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:08,589 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:08,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 10:23:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:23:08,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 10:23:08,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 10:23:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683001492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:08,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:08,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-11-08 10:23:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047334746] [2024-11-08 10:23:08,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:08,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 10:23:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 10:23:08,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-08 10:23:08,821 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 10:23:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:09,091 INFO L93 Difference]: Finished difference Result 241 states and 305 transitions. [2024-11-08 10:23:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 10:23:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 77 [2024-11-08 10:23:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:09,092 INFO L225 Difference]: With dead ends: 241 [2024-11-08 10:23:09,092 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 10:23:09,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-08 10:23:09,093 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 53 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:09,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 816 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:23:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 10:23:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2024-11-08 10:23:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 105 states have internal predecessors, (129), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 10:23:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2024-11-08 10:23:09,100 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 77 [2024-11-08 10:23:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:09,100 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2024-11-08 10:23:09,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 10:23:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2024-11-08 10:23:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 10:23:09,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:09,101 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:09,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-08 10:23:09,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:09,301 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:09,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1710737197, now seen corresponding path program 1 times [2024-11-08 10:23:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297433328] [2024-11-08 10:23:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 10:23:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 10:23:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:09,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:09,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297433328] [2024-11-08 10:23:09,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297433328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:09,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667562544] [2024-11-08 10:23:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:09,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:09,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:09,411 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:09,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 10:23:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:23:09,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:09,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667562544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:09,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-08 10:23:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035261652] [2024-11-08 10:23:09,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 10:23:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 10:23:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2024-11-08 10:23:09,669 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 10:23:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:09,768 INFO L93 Difference]: Finished difference Result 324 states and 416 transitions. [2024-11-08 10:23:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 10:23:09,768 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2024-11-08 10:23:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:09,769 INFO L225 Difference]: With dead ends: 324 [2024-11-08 10:23:09,769 INFO L226 Difference]: Without dead ends: 210 [2024-11-08 10:23:09,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2024-11-08 10:23:09,770 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 240 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:09,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 412 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-08 10:23:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 133. [2024-11-08 10:23:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 123 states have internal predecessors, (153), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 10:23:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2024-11-08 10:23:09,779 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 81 [2024-11-08 10:23:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:09,779 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2024-11-08 10:23:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 10:23:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2024-11-08 10:23:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 10:23:09,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:09,780 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:09,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 10:23:09,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:09,981 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash 522519232, now seen corresponding path program 1 times [2024-11-08 10:23:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044468864] [2024-11-08 10:23:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 10:23:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 10:23:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:23:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:10,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044468864] [2024-11-08 10:23:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044468864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:10,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019276481] [2024-11-08 10:23:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:10,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:10,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:10,174 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:10,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 10:23:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:23:10,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 10:23:10,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 10:23:10,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019276481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:10,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:10,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 19 [2024-11-08 10:23:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804927255] [2024-11-08 10:23:10,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:10,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 10:23:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:10,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 10:23:10,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:23:10,550 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 17 states have internal predecessors, (91), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 10:23:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:10,818 INFO L93 Difference]: Finished difference Result 243 states and 309 transitions. [2024-11-08 10:23:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 10:23:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 17 states have internal predecessors, (91), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2024-11-08 10:23:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:10,818 INFO L225 Difference]: With dead ends: 243 [2024-11-08 10:23:10,818 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:23:10,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-11-08 10:23:10,819 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:10,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 278 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:23:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:23:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:23:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:23:10,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2024-11-08 10:23:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:10,820 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:23:10,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 17 states have internal predecessors, (91), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 10:23:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:23:10,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:23:10,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:23:10,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-08 10:23:11,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:11,029 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:11,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:23:15,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:23:15,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:23:15 BoogieIcfgContainer [2024-11-08 10:23:15,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:23:15,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:23:15,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:23:15,201 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:23:15,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:59" (3/4) ... [2024-11-08 10:23:15,203 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:23:15,206 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-11-08 10:23:15,207 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-08 10:23:15,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-08 10:23:15,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-08 10:23:15,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:23:15,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:23:15,234 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < \old(m)) && ((((e == \old(e)) && (m == \old(m))) && (m <= 33554431)) || (((((e <= \old(e)) && ((m % 2) == 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (m <= 33554431)))) [2024-11-08 10:23:15,234 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < \old(m)) && ((((\old(e) <= e) && (0 <= 0)) && (\old(m) != 1)) || (((e == \old(e)) && (m == \old(m))) && (16777216 <= m)))) [2024-11-08 10:23:15,256 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < \old(m)) && ((((\old(e) <= e) && (0 <= 0)) && (\old(m) != 1)) || (((e == \old(e)) && (m == \old(m))) && (16777216 <= m)))) [2024-11-08 10:23:15,256 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < \old(m)) && ((((e == \old(e)) && (m == \old(m))) && (m <= 33554431)) || (((((e <= \old(e)) && ((m % 2) == 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (m <= 33554431)))) [2024-11-08 10:23:15,297 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:23:15,297 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:23:15,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:23:15,298 INFO L158 Benchmark]: Toolchain (without parser) took 16291.15ms. Allocated memory was 138.4MB in the beginning and 509.6MB in the end (delta: 371.2MB). Free memory was 67.2MB in the beginning and 314.5MB in the end (delta: -247.3MB). Peak memory consumption was 125.5MB. Max. memory is 16.1GB. [2024-11-08 10:23:15,298 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:23:15,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.93ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 66.8MB in the beginning and 169.9MB in the end (delta: -103.1MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-08 10:23:15,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.19ms. Allocated memory is still 201.3MB. Free memory was 169.9MB in the beginning and 169.4MB in the end (delta: 492.9kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-08 10:23:15,298 INFO L158 Benchmark]: Boogie Preprocessor took 34.59ms. Allocated memory is still 201.3MB. Free memory was 169.4MB in the beginning and 167.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:23:15,299 INFO L158 Benchmark]: RCFGBuilder took 387.95ms. Allocated memory is still 201.3MB. Free memory was 167.3MB in the beginning and 146.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 10:23:15,299 INFO L158 Benchmark]: TraceAbstraction took 15465.41ms. Allocated memory was 201.3MB in the beginning and 509.6MB in the end (delta: 308.3MB). Free memory was 145.2MB in the beginning and 321.8MB in the end (delta: -176.6MB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. [2024-11-08 10:23:15,299 INFO L158 Benchmark]: Witness Printer took 96.49ms. Allocated memory is still 509.6MB. Free memory was 321.8MB in the beginning and 314.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 10:23:15,300 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.93ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 66.8MB in the beginning and 169.9MB in the end (delta: -103.1MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.19ms. Allocated memory is still 201.3MB. Free memory was 169.9MB in the beginning and 169.4MB in the end (delta: 492.9kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.59ms. Allocated memory is still 201.3MB. Free memory was 169.4MB in the beginning and 167.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 387.95ms. Allocated memory is still 201.3MB. Free memory was 167.3MB in the beginning and 146.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15465.41ms. Allocated memory was 201.3MB in the beginning and 509.6MB in the end (delta: 308.3MB). Free memory was 145.2MB in the beginning and 321.8MB in the end (delta: -176.6MB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. * Witness Printer took 96.49ms. Allocated memory is still 509.6MB. Free memory was 321.8MB in the beginning and 314.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 977 mSDsluCounter, 9542 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7669 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2299 IncrementalHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 1873 mSDtfsCounter, 2299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1903 GetRequests, 1690 SyntacticMatches, 3 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=14, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 336 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2327 NumberOfCodeBlocks, 2327 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2822 ConstructedInterpolants, 0 QuantifiedInterpolants, 5144 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3190 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 48 InterpolantComputations, 14 PerfectInterpolantSequences, 1381/1735 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((0 < \old(m)) && ((((e == \old(e)) && (m == \old(m))) && (m <= 33554431)) || (((((e <= \old(e)) && ((m % 2) == 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (m <= 33554431)))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((0 < \old(m)) && ((((\old(e) <= e) && (0 <= 0)) && (\old(m) != 1)) || (((e == \old(e)) && (m == \old(m))) && (16777216 <= m)))) - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Ensures: ((\result == 0) || (0 < m)) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:23:15,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE