./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/systemc/bist_cell.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 de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:54:18,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:54:18,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:54:18,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:54:18,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:54:18,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:54:18,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:54:18,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:54:18,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:54:18,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:54:18,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:54:18,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:54:18,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:54:18,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:54:18,865 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:54:18,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:54:18,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:54:18,866 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:54:18,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:54:18,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:54:18,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:54:18,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:54:18,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:54:18,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:54:18,867 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:54:18,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:54:18,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:54:18,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:54:18,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:54:18,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:54:18,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:54:18,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:54:18,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:54:18,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:54:18,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:54:18,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:54:18,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:54:18,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:54:18,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:54:18,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:54:18,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:54:18,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:54:18,872 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:54:19,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:54:19,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:54:19,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:54:19,094 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:54:19,095 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:54:19,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-11-22 23:54:20,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:54:20,223 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:54:20,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-11-22 23:54:20,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0663749/a6b27841a47b4ddfb589402cf2e76036/FLAG15a49969e [2023-11-22 23:54:20,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0663749/a6b27841a47b4ddfb589402cf2e76036 [2023-11-22 23:54:20,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:54:20,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:54:20,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:54:20,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:54:20,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:54:20,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464596f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20, skipping insertion in model container [2023-11-22 23:54:20,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,273 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:54:20,385 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-11-22 23:54:20,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:54:20,460 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:54:20,470 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-11-22 23:54:20,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:54:20,531 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:54:20,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20 WrapperNode [2023-11-22 23:54:20,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:54:20,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:54:20,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:54:20,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:54:20,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,567 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2023-11-22 23:54:20,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:54:20,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:54:20,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:54:20,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:54:20,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:54:20,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:54:20,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:54:20,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:54:20,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (1/1) ... [2023-11-22 23:54:20,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:54:20,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:20,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 23:54:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 23:54:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:54:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-22 23:54:20,668 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-22 23:54:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-22 23:54:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-22 23:54:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-22 23:54:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-22 23:54:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-22 23:54:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-22 23:54:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:54:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-22 23:54:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-22 23:54:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:54:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:54:20,737 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:54:20,739 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:54:20,945 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:54:20,984 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:54:20,989 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 23:54:20,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:54:20 BoogieIcfgContainer [2023-11-22 23:54:20,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:54:20,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:54:20,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:54:20,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:54:20,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:54:20" (1/3) ... [2023-11-22 23:54:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e8222d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:54:20, skipping insertion in model container [2023-11-22 23:54:21,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:20" (2/3) ... [2023-11-22 23:54:21,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e8222d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:54:21, skipping insertion in model container [2023-11-22 23:54:21,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:54:20" (3/3) ... [2023-11-22 23:54:21,003 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2023-11-22 23:54:21,015 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:54:21,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:54:21,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:54:21,058 INFO L357 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, mHoare=true, 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;@7bfd3c92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:54:21,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:54:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 23:54:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 23:54:21,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:21,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:21,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:21,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1929751186, now seen corresponding path program 1 times [2023-11-22 23:54:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:21,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236272223] [2023-11-22 23:54:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:21,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 23:54:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 23:54:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:54:21,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:21,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236272223] [2023-11-22 23:54:21,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236272223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:21,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:54:21,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 23:54:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104242108] [2023-11-22 23:54:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:21,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 23:54:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 23:54:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:54:21,497 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 23:54:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:22,195 INFO L93 Difference]: Finished difference Result 246 states and 393 transitions. [2023-11-22 23:54:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 23:54:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-11-22 23:54:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:22,205 INFO L225 Difference]: With dead ends: 246 [2023-11-22 23:54:22,205 INFO L226 Difference]: Without dead ends: 158 [2023-11-22 23:54:22,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-11-22 23:54:22,210 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 303 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:22,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 295 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 23:54:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-22 23:54:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2023-11-22 23:54:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 85 states have internal predecessors, (134), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-22 23:54:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-11-22 23:54:22,280 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 39 [2023-11-22 23:54:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:22,280 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-11-22 23:54:22,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 23:54:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-11-22 23:54:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 23:54:22,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:22,284 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-22 23:54:22,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 23:54:22,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:22,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:22,285 INFO L85 PathProgramCache]: Analyzing trace with hash -609134686, now seen corresponding path program 1 times [2023-11-22 23:54:22,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:22,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241606365] [2023-11-22 23:54:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 23:54:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 23:54:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 23:54:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 23:54:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 23:54:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241606365] [2023-11-22 23:54:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241606365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464768779] [2023-11-22 23:54:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:22,536 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) [2023-11-22 23:54:22,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 23:54:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:22,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 23:54:22,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 23:54:22,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464768779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:22,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:22,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-22 23:54:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9515317] [2023-11-22 23:54:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:22,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:22,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:22,702 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:22,720 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2023-11-22 23:54:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 23:54:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:22,722 INFO L225 Difference]: With dead ends: 194 [2023-11-22 23:54:22,722 INFO L226 Difference]: Without dead ends: 101 [2023-11-22 23:54:22,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:22,724 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:22,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-22 23:54:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-22 23:54:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 85 states have internal predecessors, (133), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-22 23:54:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2023-11-22 23:54:22,733 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 92 [2023-11-22 23:54:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:22,733 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2023-11-22 23:54:22,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2023-11-22 23:54:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 23:54:22,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:22,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-22 23:54:22,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 23:54:22,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:22,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:22,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1751637152, now seen corresponding path program 1 times [2023-11-22 23:54:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079507295] [2023-11-22 23:54:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 23:54:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 23:54:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 23:54:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 23:54:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 23:54:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:23,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079507295] [2023-11-22 23:54:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079507295] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409888659] [2023-11-22 23:54:23,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:23,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:23,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:23,093 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) [2023-11-22 23:54:23,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 23:54:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:23,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 23:54:23,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:23,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409888659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:23,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:23,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 23:54:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746552604] [2023-11-22 23:54:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:23,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:23,283 INFO L87 Difference]: Start difference. First operand 101 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:23,433 INFO L93 Difference]: Finished difference Result 302 states and 471 transitions. [2023-11-22 23:54:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 23:54:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:23,435 INFO L225 Difference]: With dead ends: 302 [2023-11-22 23:54:23,435 INFO L226 Difference]: Without dead ends: 211 [2023-11-22 23:54:23,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:23,436 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:23,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 322 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-22 23:54:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2023-11-22 23:54:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 168 states have internal predecessors, (260), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2023-11-22 23:54:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2023-11-22 23:54:23,452 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 92 [2023-11-22 23:54:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:23,452 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2023-11-22 23:54:23,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2023-11-22 23:54:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 23:54:23,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:23,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-22 23:54:23,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:23,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-22 23:54:23,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:23,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1617302816, now seen corresponding path program 1 times [2023-11-22 23:54:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:23,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844574952] [2023-11-22 23:54:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:23,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 23:54:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 23:54:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 23:54:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 23:54:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 23:54:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:23,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844574952] [2023-11-22 23:54:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844574952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167408377] [2023-11-22 23:54:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:23,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:23,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:23,779 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) [2023-11-22 23:54:23,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 23:54:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:23,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:23,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 23:54:23,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167408377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 23:54:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224411184] [2023-11-22 23:54:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:23,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:23,940 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:24,087 INFO L93 Difference]: Finished difference Result 593 states and 936 transitions. [2023-11-22 23:54:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:24,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 23:54:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:24,089 INFO L225 Difference]: With dead ends: 593 [2023-11-22 23:54:24,089 INFO L226 Difference]: Without dead ends: 409 [2023-11-22 23:54:24,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:24,091 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 215 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:24,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 314 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-22 23:54:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 395. [2023-11-22 23:54:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 328 states have (on average 1.5609756097560976) internal successors, (512), 337 states have internal predecessors, (512), 37 states have call successors, (37), 21 states have call predecessors, (37), 29 states have return successors, (71), 40 states have call predecessors, (71), 37 states have call successors, (71) [2023-11-22 23:54:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 620 transitions. [2023-11-22 23:54:24,114 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 620 transitions. Word has length 92 [2023-11-22 23:54:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:24,115 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 620 transitions. [2023-11-22 23:54:24,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 620 transitions. [2023-11-22 23:54:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 23:54:24,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:24,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-22 23:54:24,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-22 23:54:24,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:24,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:24,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1468221796, now seen corresponding path program 1 times [2023-11-22 23:54:24,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:24,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119296991] [2023-11-22 23:54:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 23:54:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 23:54:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 23:54:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 23:54:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 23:54:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:24,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119296991] [2023-11-22 23:54:24,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119296991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:24,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204886603] [2023-11-22 23:54:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:24,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:24,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:24,447 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) [2023-11-22 23:54:24,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 23:54:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:24,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:24,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 23:54:24,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204886603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 23:54:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102007296] [2023-11-22 23:54:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:24,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:24,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:24,589 INFO L87 Difference]: Start difference. First operand 395 states and 620 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:24,750 INFO L93 Difference]: Finished difference Result 1308 states and 2136 transitions. [2023-11-22 23:54:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:24,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 23:54:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:24,758 INFO L225 Difference]: With dead ends: 1308 [2023-11-22 23:54:24,758 INFO L226 Difference]: Without dead ends: 935 [2023-11-22 23:54:24,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:24,761 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 233 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:24,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 355 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2023-11-22 23:54:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 863. [2023-11-22 23:54:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 722 states have (on average 1.5401662049861495) internal successors, (1112), 749 states have internal predecessors, (1112), 73 states have call successors, (73), 41 states have call predecessors, (73), 67 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2023-11-22 23:54:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1386 transitions. [2023-11-22 23:54:24,828 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1386 transitions. Word has length 92 [2023-11-22 23:54:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:24,828 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1386 transitions. [2023-11-22 23:54:24,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1386 transitions. [2023-11-22 23:54:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 23:54:24,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:24,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-22 23:54:24,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:25,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:25,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:25,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:25,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2131635018, now seen corresponding path program 1 times [2023-11-22 23:54:25,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:25,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214050759] [2023-11-22 23:54:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:25,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 23:54:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 23:54:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 23:54:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 23:54:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 23:54:25,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214050759] [2023-11-22 23:54:25,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214050759] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593956207] [2023-11-22 23:54:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:25,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:25,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:25,228 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) [2023-11-22 23:54:25,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 23:54:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:25,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-22 23:54:25,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593956207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:25,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 23:54:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219815871] [2023-11-22 23:54:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:25,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:25,391 INFO L87 Difference]: Start difference. First operand 863 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:25,567 INFO L93 Difference]: Finished difference Result 2816 states and 4760 transitions. [2023-11-22 23:54:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:25,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-11-22 23:54:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:25,575 INFO L225 Difference]: With dead ends: 2816 [2023-11-22 23:54:25,575 INFO L226 Difference]: Without dead ends: 1993 [2023-11-22 23:54:25,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:25,579 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 223 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:25,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 332 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2023-11-22 23:54:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1885. [2023-11-22 23:54:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1578 states have (on average 1.5158428390367553) internal successors, (2392), 1659 states have internal predecessors, (2392), 145 states have call successors, (145), 81 states have call predecessors, (145), 161 states have return successors, (611), 160 states have call predecessors, (611), 145 states have call successors, (611) [2023-11-22 23:54:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 3148 transitions. [2023-11-22 23:54:25,701 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 3148 transitions. Word has length 94 [2023-11-22 23:54:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:25,701 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 3148 transitions. [2023-11-22 23:54:25,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 3148 transitions. [2023-11-22 23:54:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 23:54:25,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:25,709 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-22 23:54:25,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:25,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:25,922 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:25,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash -86155466, now seen corresponding path program 1 times [2023-11-22 23:54:25,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:25,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960554739] [2023-11-22 23:54:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 23:54:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 23:54:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 23:54:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 23:54:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 23:54:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960554739] [2023-11-22 23:54:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960554739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865333276] [2023-11-22 23:54:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:26,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:26,040 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) [2023-11-22 23:54:26,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 23:54:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 23:54:26,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:54:26,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865333276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-22 23:54:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264477257] [2023-11-22 23:54:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:26,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 23:54:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 23:54:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:26,161 INFO L87 Difference]: Start difference. First operand 1885 states and 3148 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:26,252 INFO L93 Difference]: Finished difference Result 4002 states and 6653 transitions. [2023-11-22 23:54:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 23:54:26,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-11-22 23:54:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:26,261 INFO L225 Difference]: With dead ends: 4002 [2023-11-22 23:54:26,261 INFO L226 Difference]: Without dead ends: 2221 [2023-11-22 23:54:26,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-22 23:54:26,266 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 28 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:26,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 597 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2023-11-22 23:54:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1949. [2023-11-22 23:54:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1626 states have (on average 1.5006150061500616) internal successors, (2440), 1707 states have internal predecessors, (2440), 145 states have call successors, (145), 81 states have call predecessors, (145), 177 states have return successors, (643), 176 states have call predecessors, (643), 145 states have call successors, (643) [2023-11-22 23:54:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3228 transitions. [2023-11-22 23:54:26,355 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3228 transitions. Word has length 94 [2023-11-22 23:54:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:26,355 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3228 transitions. [2023-11-22 23:54:26,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3228 transitions. [2023-11-22 23:54:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 23:54:26,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:26,362 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2023-11-22 23:54:26,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:26,574 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:26,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1452184564, now seen corresponding path program 1 times [2023-11-22 23:54:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778502019] [2023-11-22 23:54:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 23:54:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 23:54:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 23:54:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 23:54:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 23:54:26,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778502019] [2023-11-22 23:54:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778502019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523842927] [2023-11-22 23:54:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:26,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:26,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:26,672 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) [2023-11-22 23:54:26,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 23:54:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:26,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:26,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 23:54:26,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:26,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523842927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:26,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 23:54:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132394546] [2023-11-22 23:54:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:26,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:26,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:26,767 INFO L87 Difference]: Start difference. First operand 1949 states and 3228 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:26,872 INFO L93 Difference]: Finished difference Result 4258 states and 7036 transitions. [2023-11-22 23:54:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:26,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2023-11-22 23:54:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:26,881 INFO L225 Difference]: With dead ends: 4258 [2023-11-22 23:54:26,881 INFO L226 Difference]: Without dead ends: 2413 [2023-11-22 23:54:26,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:26,886 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 56 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:26,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 228 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2023-11-22 23:54:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2233. [2023-11-22 23:54:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1814 states have (on average 1.456449834619625) internal successors, (2642), 1895 states have internal predecessors, (2642), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-11-22 23:54:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3639 transitions. [2023-11-22 23:54:26,970 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3639 transitions. Word has length 94 [2023-11-22 23:54:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:26,970 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3639 transitions. [2023-11-22 23:54:26,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3639 transitions. [2023-11-22 23:54:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 23:54:26,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:26,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-11-22 23:54:26,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-22 23:54:27,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:27,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:27,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash 236030838, now seen corresponding path program 1 times [2023-11-22 23:54:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:27,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562067200] [2023-11-22 23:54:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:27,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 23:54:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 23:54:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 23:54:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 23:54:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 23:54:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562067200] [2023-11-22 23:54:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562067200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169234808] [2023-11-22 23:54:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:27,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:27,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:27,293 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) [2023-11-22 23:54:27,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 23:54:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 23:54:27,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 23:54:27,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169234808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:27,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-22 23:54:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351213881] [2023-11-22 23:54:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:27,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:54:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:27,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:54:27,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:27,385 INFO L87 Difference]: Start difference. First operand 2233 states and 3639 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:27,491 INFO L93 Difference]: Finished difference Result 4334 states and 7049 transitions. [2023-11-22 23:54:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:54:27,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-11-22 23:54:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:27,501 INFO L225 Difference]: With dead ends: 4334 [2023-11-22 23:54:27,501 INFO L226 Difference]: Without dead ends: 2297 [2023-11-22 23:54:27,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:27,506 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:27,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2023-11-22 23:54:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2265. [2023-11-22 23:54:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1846 states have (on average 1.448537378114843) internal successors, (2674), 1927 states have internal predecessors, (2674), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-11-22 23:54:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3671 transitions. [2023-11-22 23:54:27,603 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3671 transitions. Word has length 94 [2023-11-22 23:54:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:27,603 INFO L495 AbstractCegarLoop]: Abstraction has 2265 states and 3671 transitions. [2023-11-22 23:54:27,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3671 transitions. [2023-11-22 23:54:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 23:54:27,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:27,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:27,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-22 23:54:27,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-22 23:54:27,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:27,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1971241955, now seen corresponding path program 1 times [2023-11-22 23:54:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:27,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134317538] [2023-11-22 23:54:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 23:54:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 23:54:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 23:54:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 23:54:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 23:54:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 23:54:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 23:54:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 23:54:27,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:27,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134317538] [2023-11-22 23:54:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134317538] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:27,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383811829] [2023-11-22 23:54:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:27,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:27,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:27,953 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) [2023-11-22 23:54:27,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 23:54:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:28,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 23:54:28,047 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:28,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383811829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:28,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:28,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 23:54:28,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740558810] [2023-11-22 23:54:28,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:28,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:28,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:28,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:28,048 INFO L87 Difference]: Start difference. First operand 2265 states and 3671 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:28,128 INFO L93 Difference]: Finished difference Result 4634 states and 7890 transitions. [2023-11-22 23:54:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2023-11-22 23:54:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:28,137 INFO L225 Difference]: With dead ends: 4634 [2023-11-22 23:54:28,137 INFO L226 Difference]: Without dead ends: 2549 [2023-11-22 23:54:28,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:28,142 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:28,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2023-11-22 23:54:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2023-11-22 23:54:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2034 states have (on average 1.4267453294001966) internal successors, (2902), 2115 states have internal predecessors, (2902), 273 states have call successors, (273), 145 states have call predecessors, (273), 241 states have return successors, (1046), 320 states have call predecessors, (1046), 273 states have call successors, (1046) [2023-11-22 23:54:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4221 transitions. [2023-11-22 23:54:28,250 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4221 transitions. Word has length 96 [2023-11-22 23:54:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:28,250 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 4221 transitions. [2023-11-22 23:54:28,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4221 transitions. [2023-11-22 23:54:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 23:54:28,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:28,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:28,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:28,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-22 23:54:28,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:28,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1181222875, now seen corresponding path program 1 times [2023-11-22 23:54:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601274089] [2023-11-22 23:54:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 23:54:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 23:54:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 23:54:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 23:54:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 23:54:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 23:54:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 23:54:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 23:54:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601274089] [2023-11-22 23:54:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601274089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801089228] [2023-11-22 23:54:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:28,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:28,577 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) [2023-11-22 23:54:28,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 23:54:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:28,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:28,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:28,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801089228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:28,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 23:54:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734600862] [2023-11-22 23:54:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:28,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:28,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:28,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:28,707 INFO L87 Difference]: Start difference. First operand 2549 states and 4221 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:28,956 INFO L93 Difference]: Finished difference Result 7898 states and 13749 transitions. [2023-11-22 23:54:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 23:54:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2023-11-22 23:54:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:28,977 INFO L225 Difference]: With dead ends: 7898 [2023-11-22 23:54:28,978 INFO L226 Difference]: Without dead ends: 5577 [2023-11-22 23:54:28,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:28,984 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 183 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:28,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 576 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2023-11-22 23:54:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 5493. [2023-11-22 23:54:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4254937163375225) internal successors, (6352), 4723 states have internal predecessors, (6352), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-11-22 23:54:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9389 transitions. [2023-11-22 23:54:29,212 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9389 transitions. Word has length 96 [2023-11-22 23:54:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:29,212 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9389 transitions. [2023-11-22 23:54:29,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9389 transitions. [2023-11-22 23:54:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 23:54:29,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:29,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:29,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:29,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-22 23:54:29,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:29,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1860495129, now seen corresponding path program 1 times [2023-11-22 23:54:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149816797] [2023-11-22 23:54:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 23:54:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:54:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 23:54:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 23:54:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 23:54:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 23:54:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 23:54:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 23:54:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 23:54:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 23:54:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149816797] [2023-11-22 23:54:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149816797] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470458353] [2023-11-22 23:54:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:29,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:29,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:29,569 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) [2023-11-22 23:54:29,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-22 23:54:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:29,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 23:54:29,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:29,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:29,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470458353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:29,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:29,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 23:54:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679780448] [2023-11-22 23:54:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:29,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:29,688 INFO L87 Difference]: Start difference. First operand 5493 states and 9389 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:29,957 INFO L93 Difference]: Finished difference Result 11994 states and 20213 transitions. [2023-11-22 23:54:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:29,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2023-11-22 23:54:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:29,984 INFO L225 Difference]: With dead ends: 11994 [2023-11-22 23:54:29,984 INFO L226 Difference]: Without dead ends: 6727 [2023-11-22 23:54:29,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:29,997 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:29,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 304 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2023-11-22 23:54:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5493. [2023-11-22 23:54:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4252692998204668) internal successors, (6351), 4723 states have internal predecessors, (6351), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-11-22 23:54:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9388 transitions. [2023-11-22 23:54:30,236 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9388 transitions. Word has length 96 [2023-11-22 23:54:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:30,236 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9388 transitions. [2023-11-22 23:54:30,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9388 transitions. [2023-11-22 23:54:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-22 23:54:30,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:30,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:30,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:30,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 23:54:30,464 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:30,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash -315091207, now seen corresponding path program 1 times [2023-11-22 23:54:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:30,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542789832] [2023-11-22 23:54:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:54:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 23:54:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 23:54:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-22 23:54:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 23:54:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 23:54:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 23:54:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 23:54:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 23:54:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:30,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542789832] [2023-11-22 23:54:30,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542789832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301295507] [2023-11-22 23:54:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:30,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:30,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:30,593 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) [2023-11-22 23:54:30,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-22 23:54:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:30,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:30,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 23:54:30,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301295507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 23:54:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368815363] [2023-11-22 23:54:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:30,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:30,679 INFO L87 Difference]: Start difference. First operand 5493 states and 9388 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:30,812 INFO L93 Difference]: Finished difference Result 10940 states and 19073 transitions. [2023-11-22 23:54:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:30,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2023-11-22 23:54:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:30,830 INFO L225 Difference]: With dead ends: 10940 [2023-11-22 23:54:30,831 INFO L226 Difference]: Without dead ends: 5853 [2023-11-22 23:54:30,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:30,843 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:30,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2023-11-22 23:54:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5853. [2023-11-22 23:54:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.416025641025641) internal successors, (6627), 4939 states have internal predecessors, (6627), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-11-22 23:54:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10120 transitions. [2023-11-22 23:54:31,109 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10120 transitions. Word has length 97 [2023-11-22 23:54:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:31,110 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10120 transitions. [2023-11-22 23:54:31,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10120 transitions. [2023-11-22 23:54:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-22 23:54:31,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:31,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:31,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:31,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-22 23:54:31,343 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:31,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1457593673, now seen corresponding path program 1 times [2023-11-22 23:54:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:31,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067834685] [2023-11-22 23:54:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:54:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 23:54:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 23:54:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-22 23:54:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 23:54:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 23:54:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 23:54:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 23:54:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 23:54:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067834685] [2023-11-22 23:54:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067834685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:31,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991655688] [2023-11-22 23:54:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:31,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:31,443 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) [2023-11-22 23:54:31,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-22 23:54:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:31,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 23:54:31,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 23:54:31,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991655688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:31,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:31,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 23:54:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007231114] [2023-11-22 23:54:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:31,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:31,568 INFO L87 Difference]: Start difference. First operand 5853 states and 10120 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:31,845 INFO L93 Difference]: Finished difference Result 12398 states and 21091 transitions. [2023-11-22 23:54:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2023-11-22 23:54:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:31,868 INFO L225 Difference]: With dead ends: 12398 [2023-11-22 23:54:31,868 INFO L226 Difference]: Without dead ends: 6807 [2023-11-22 23:54:31,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:31,883 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:31,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2023-11-22 23:54:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 5853. [2023-11-22 23:54:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.4151709401709403) internal successors, (6623), 4939 states have internal predecessors, (6623), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-11-22 23:54:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10116 transitions. [2023-11-22 23:54:32,143 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10116 transitions. Word has length 97 [2023-11-22 23:54:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:32,143 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10116 transitions. [2023-11-22 23:54:32,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10116 transitions. [2023-11-22 23:54:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 23:54:32,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:32,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:32,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:32,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 23:54:32,368 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:32,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1091145433, now seen corresponding path program 1 times [2023-11-22 23:54:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15199271] [2023-11-22 23:54:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 23:54:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 23:54:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 23:54:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 23:54:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 23:54:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 23:54:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 23:54:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15199271] [2023-11-22 23:54:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15199271] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916057366] [2023-11-22 23:54:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:32,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:32,455 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) [2023-11-22 23:54:32,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-22 23:54:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:32,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:32,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 23:54:32,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916057366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 23:54:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939743606] [2023-11-22 23:54:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:32,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:32,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:32,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:32,538 INFO L87 Difference]: Start difference. First operand 5853 states and 10116 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:32,761 INFO L93 Difference]: Finished difference Result 11856 states and 20687 transitions. [2023-11-22 23:54:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:32,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2023-11-22 23:54:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:32,777 INFO L225 Difference]: With dead ends: 11856 [2023-11-22 23:54:32,777 INFO L226 Difference]: Without dead ends: 6465 [2023-11-22 23:54:32,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:32,784 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:32,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 235 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2023-11-22 23:54:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 6465. [2023-11-22 23:54:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6465 states, 5076 states have (on average 1.3977541371158393) internal successors, (7095), 5335 states have internal predecessors, (7095), 721 states have call successors, (721), 377 states have call predecessors, (721), 667 states have return successors, (3444), 816 states have call predecessors, (3444), 721 states have call successors, (3444) [2023-11-22 23:54:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6465 states to 6465 states and 11260 transitions. [2023-11-22 23:54:33,016 INFO L78 Accepts]: Start accepts. Automaton has 6465 states and 11260 transitions. Word has length 99 [2023-11-22 23:54:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:33,016 INFO L495 AbstractCegarLoop]: Abstraction has 6465 states and 11260 transitions. [2023-11-22 23:54:33,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6465 states and 11260 transitions. [2023-11-22 23:54:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 23:54:33,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:33,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:33,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:33,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:33,243 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:33,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1930179095, now seen corresponding path program 1 times [2023-11-22 23:54:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:33,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51527619] [2023-11-22 23:54:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 23:54:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 23:54:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 23:54:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 23:54:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 23:54:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 23:54:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 23:54:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51527619] [2023-11-22 23:54:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51527619] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325018990] [2023-11-22 23:54:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:33,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:33,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:33,328 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) [2023-11-22 23:54:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-22 23:54:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:33,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:33,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:33,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325018990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:33,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:33,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 23:54:33,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022442012] [2023-11-22 23:54:33,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:33,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:33,447 INFO L87 Difference]: Start difference. First operand 6465 states and 11260 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:33,759 INFO L93 Difference]: Finished difference Result 12480 states and 20997 transitions. [2023-11-22 23:54:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 23:54:33,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2023-11-22 23:54:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:33,775 INFO L225 Difference]: With dead ends: 12480 [2023-11-22 23:54:33,776 INFO L226 Difference]: Without dead ends: 6565 [2023-11-22 23:54:33,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:33,785 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 178 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:33,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 547 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2023-11-22 23:54:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 6561. [2023-11-22 23:54:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 5148 states have (on average 1.385975135975136) internal successors, (7135), 5431 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-11-22 23:54:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 10872 transitions. [2023-11-22 23:54:34,152 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 10872 transitions. Word has length 99 [2023-11-22 23:54:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:34,152 INFO L495 AbstractCegarLoop]: Abstraction has 6561 states and 10872 transitions. [2023-11-22 23:54:34,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 10872 transitions. [2023-11-22 23:54:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 23:54:34,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:34,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:34,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:34,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-22 23:54:34,382 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:34,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash -96433003, now seen corresponding path program 2 times [2023-11-22 23:54:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:34,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201023840] [2023-11-22 23:54:34,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 23:54:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 23:54:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 23:54:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 23:54:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 23:54:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 23:54:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 23:54:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:34,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201023840] [2023-11-22 23:54:34,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201023840] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:34,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103819235] [2023-11-22 23:54:34,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:54:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:34,479 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) [2023-11-22 23:54:34,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-22 23:54:34,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-22 23:54:34,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:54:34,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 23:54:34,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-22 23:54:34,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:34,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103819235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:34,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:34,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-22 23:54:34,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205094953] [2023-11-22 23:54:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:34,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:54:34,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:34,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:54:34,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:34,555 INFO L87 Difference]: Start difference. First operand 6561 states and 10872 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 23:54:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:34,810 INFO L93 Difference]: Finished difference Result 8221 states and 15175 transitions. [2023-11-22 23:54:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:54:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-11-22 23:54:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:34,838 INFO L225 Difference]: With dead ends: 8221 [2023-11-22 23:54:34,838 INFO L226 Difference]: Without dead ends: 8217 [2023-11-22 23:54:34,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:34,843 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 37 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:34,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 447 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2023-11-22 23:54:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 6689. [2023-11-22 23:54:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 5276 states have (on average 1.3766110689916604) internal successors, (7263), 5559 states have internal predecessors, (7263), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-11-22 23:54:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 11000 transitions. [2023-11-22 23:54:35,164 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 11000 transitions. Word has length 99 [2023-11-22 23:54:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:35,165 INFO L495 AbstractCegarLoop]: Abstraction has 6689 states and 11000 transitions. [2023-11-22 23:54:35,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 23:54:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 11000 transitions. [2023-11-22 23:54:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 23:54:35,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:35,179 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:35,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:35,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-22 23:54:35,390 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:35,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -39174701, now seen corresponding path program 1 times [2023-11-22 23:54:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:35,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875476664] [2023-11-22 23:54:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 23:54:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 23:54:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 23:54:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 23:54:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 23:54:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 23:54:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 23:54:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 23:54:35,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:35,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875476664] [2023-11-22 23:54:35,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875476664] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:35,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585288834] [2023-11-22 23:54:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:35,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:35,478 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) [2023-11-22 23:54:35,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-22 23:54:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:35,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 23:54:35,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 23:54:35,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:35,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585288834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:35,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:35,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-22 23:54:35,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287399268] [2023-11-22 23:54:35,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:35,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 23:54:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 23:54:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:35,580 INFO L87 Difference]: Start difference. First operand 6689 states and 11000 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 23:54:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:35,799 INFO L93 Difference]: Finished difference Result 12748 states and 20399 transitions. [2023-11-22 23:54:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:35,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-11-22 23:54:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:35,818 INFO L225 Difference]: With dead ends: 12748 [2023-11-22 23:54:35,818 INFO L226 Difference]: Without dead ends: 6625 [2023-11-22 23:54:35,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:35,829 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:35,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 584 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2023-11-22 23:54:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6625. [2023-11-22 23:54:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 5212 states have (on average 1.3689562547966232) internal successors, (7135), 5495 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-11-22 23:54:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10872 transitions. [2023-11-22 23:54:36,155 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10872 transitions. Word has length 99 [2023-11-22 23:54:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:36,155 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 10872 transitions. [2023-11-22 23:54:36,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 23:54:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10872 transitions. [2023-11-22 23:54:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-22 23:54:36,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:36,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:36,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:36,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-22 23:54:36,383 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:36,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash 871855670, now seen corresponding path program 1 times [2023-11-22 23:54:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193876548] [2023-11-22 23:54:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 23:54:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 23:54:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 23:54:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 23:54:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 23:54:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 23:54:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 23:54:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 23:54:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193876548] [2023-11-22 23:54:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193876548] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769767318] [2023-11-22 23:54:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:36,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:36,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:36,471 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) [2023-11-22 23:54:36,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-22 23:54:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:36,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:36,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:36,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769767318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:36,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 23:54:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484081077] [2023-11-22 23:54:36,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:36,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:36,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:36,620 INFO L87 Difference]: Start difference. First operand 6625 states and 10872 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:36,929 INFO L93 Difference]: Finished difference Result 12940 states and 20614 transitions. [2023-11-22 23:54:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 23:54:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2023-11-22 23:54:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:36,949 INFO L225 Difference]: With dead ends: 12940 [2023-11-22 23:54:36,949 INFO L226 Difference]: Without dead ends: 6845 [2023-11-22 23:54:36,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:36,962 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 192 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:36,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 570 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2023-11-22 23:54:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6841. [2023-11-22 23:54:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3492210682492582) internal successors, (7275), 5711 states have internal predecessors, (7275), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-11-22 23:54:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10652 transitions. [2023-11-22 23:54:37,245 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10652 transitions. Word has length 102 [2023-11-22 23:54:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:37,246 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10652 transitions. [2023-11-22 23:54:37,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10652 transitions. [2023-11-22 23:54:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-22 23:54:37,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:37,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:37,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:37,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:37,475 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:37,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -814324168, now seen corresponding path program 1 times [2023-11-22 23:54:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621907376] [2023-11-22 23:54:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 23:54:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 23:54:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 23:54:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 23:54:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 23:54:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 23:54:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 23:54:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 23:54:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621907376] [2023-11-22 23:54:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621907376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506144090] [2023-11-22 23:54:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:37,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:37,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:37,560 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:37,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-22 23:54:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:37,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 23:54:37,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-22 23:54:37,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506144090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:37,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:37,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-22 23:54:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521469227] [2023-11-22 23:54:37,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:37,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:37,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:37,702 INFO L87 Difference]: Start difference. First operand 6841 states and 10652 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:37,949 INFO L93 Difference]: Finished difference Result 14070 states and 21801 transitions. [2023-11-22 23:54:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2023-11-22 23:54:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:37,972 INFO L225 Difference]: With dead ends: 14070 [2023-11-22 23:54:37,972 INFO L226 Difference]: Without dead ends: 7543 [2023-11-22 23:54:37,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:37,984 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 76 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:37,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 222 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7543 states. [2023-11-22 23:54:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7543 to 6841. [2023-11-22 23:54:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3477373887240356) internal successors, (7267), 5711 states have internal predecessors, (7267), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-11-22 23:54:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10644 transitions. [2023-11-22 23:54:38,260 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10644 transitions. Word has length 102 [2023-11-22 23:54:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:38,261 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10644 transitions. [2023-11-22 23:54:38,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10644 transitions. [2023-11-22 23:54:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 23:54:38,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:38,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:38,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:38,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:38,486 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:38,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1864122538, now seen corresponding path program 1 times [2023-11-22 23:54:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:38,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194407352] [2023-11-22 23:54:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:38,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 23:54:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 23:54:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 23:54:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 23:54:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194407352] [2023-11-22 23:54:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194407352] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036760251] [2023-11-22 23:54:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:38,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:38,578 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:38,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-22 23:54:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:38,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:38,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 23:54:38,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036760251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:38,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-22 23:54:38,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877698040] [2023-11-22 23:54:38,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:38,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:38,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:54:38,665 INFO L87 Difference]: Start difference. First operand 6841 states and 10644 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:38,956 INFO L93 Difference]: Finished difference Result 14110 states and 21908 transitions. [2023-11-22 23:54:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-11-22 23:54:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:38,979 INFO L225 Difference]: With dead ends: 14110 [2023-11-22 23:54:38,980 INFO L226 Difference]: Without dead ends: 7803 [2023-11-22 23:54:38,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:54:38,992 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:38,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 237 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2023-11-22 23:54:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7803. [2023-11-22 23:54:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 6030 states have (on average 1.3203980099502488) internal successors, (7962), 6349 states have internal predecessors, (7962), 937 states have call successors, (937), 485 states have call predecessors, (937), 835 states have return successors, (3180), 1032 states have call predecessors, (3180), 937 states have call successors, (3180) [2023-11-22 23:54:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 12079 transitions. [2023-11-22 23:54:39,404 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 12079 transitions. Word has length 104 [2023-11-22 23:54:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:39,405 INFO L495 AbstractCegarLoop]: Abstraction has 7803 states and 12079 transitions. [2023-11-22 23:54:39,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 12079 transitions. [2023-11-22 23:54:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 23:54:39,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:39,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:39,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:39,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-22 23:54:39,636 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:39,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 721620072, now seen corresponding path program 1 times [2023-11-22 23:54:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393195184] [2023-11-22 23:54:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 23:54:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 23:54:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 23:54:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 23:54:39,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:39,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393195184] [2023-11-22 23:54:39,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393195184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:39,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308340340] [2023-11-22 23:54:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:39,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:39,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:39,730 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:39,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-22 23:54:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:39,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:39,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:39,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:39,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308340340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:39,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:39,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-22 23:54:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776400718] [2023-11-22 23:54:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:39,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:39,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:39,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:39,851 INFO L87 Difference]: Start difference. First operand 7803 states and 12079 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:40,256 INFO L93 Difference]: Finished difference Result 15114 states and 22661 transitions. [2023-11-22 23:54:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 23:54:40,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-11-22 23:54:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:40,277 INFO L225 Difference]: With dead ends: 15114 [2023-11-22 23:54:40,277 INFO L226 Difference]: Without dead ends: 7969 [2023-11-22 23:54:40,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:40,292 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 173 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:40,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 508 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2023-11-22 23:54:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 7965. [2023-11-22 23:54:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 6138 states have (on average 1.30514825676116) internal successors, (8011), 6511 states have internal predecessors, (8011), 937 states have call successors, (937), 485 states have call predecessors, (937), 889 states have return successors, (2884), 1032 states have call predecessors, (2884), 937 states have call successors, (2884) [2023-11-22 23:54:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 11832 transitions. [2023-11-22 23:54:40,719 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 11832 transitions. Word has length 104 [2023-11-22 23:54:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:40,719 INFO L495 AbstractCegarLoop]: Abstraction has 7965 states and 11832 transitions. [2023-11-22 23:54:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 23:54:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 11832 transitions. [2023-11-22 23:54:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 23:54:40,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:40,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:40,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:40,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-22 23:54:40,948 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:40,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1400892326, now seen corresponding path program 1 times [2023-11-22 23:54:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:40,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124204543] [2023-11-22 23:54:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 23:54:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 23:54:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 23:54:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 23:54:41,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:41,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124204543] [2023-11-22 23:54:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124204543] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:41,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116308835] [2023-11-22 23:54:41,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:41,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:41,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:41,031 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:41,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-22 23:54:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:41,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 23:54:41,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-22 23:54:41,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116308835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:41,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-22 23:54:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791640134] [2023-11-22 23:54:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:41,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:54:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:41,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:54:41,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:54:41,198 INFO L87 Difference]: Start difference. First operand 7965 states and 11832 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 23:54:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:41,655 INFO L93 Difference]: Finished difference Result 11491 states and 16748 transitions. [2023-11-22 23:54:41,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:54:41,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 104 [2023-11-22 23:54:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:41,678 INFO L225 Difference]: With dead ends: 11491 [2023-11-22 23:54:41,678 INFO L226 Difference]: Without dead ends: 11487 [2023-11-22 23:54:41,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:41,682 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 159 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:41,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 206 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11487 states. [2023-11-22 23:54:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11487 to 11455. [2023-11-22 23:54:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11455 states, 8966 states have (on average 1.299018514387687) internal successors, (11647), 9469 states have internal predecessors, (11647), 1211 states have call successors, (1211), 727 states have call predecessors, (1211), 1277 states have return successors, (3839), 1354 states have call predecessors, (3839), 1211 states have call successors, (3839) [2023-11-22 23:54:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11455 states to 11455 states and 16697 transitions. [2023-11-22 23:54:42,118 INFO L78 Accepts]: Start accepts. Automaton has 11455 states and 16697 transitions. Word has length 104 [2023-11-22 23:54:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:42,119 INFO L495 AbstractCegarLoop]: Abstraction has 11455 states and 16697 transitions. [2023-11-22 23:54:42,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 23:54:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 11455 states and 16697 transitions. [2023-11-22 23:54:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-22 23:54:42,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:42,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:42,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:42,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:42,350 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:42,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 529672484, now seen corresponding path program 1 times [2023-11-22 23:54:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021952634] [2023-11-22 23:54:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 23:54:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 23:54:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 23:54:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 23:54:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 23:54:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 23:54:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 23:54:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 23:54:42,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021952634] [2023-11-22 23:54:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021952634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469551417] [2023-11-22 23:54:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:42,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:42,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:42,436 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:42,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-22 23:54:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:42,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:54:42,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 23:54:42,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:54:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-22 23:54:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469551417] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:54:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 4] total 11 [2023-11-22 23:54:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129149977] [2023-11-22 23:54:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:42,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:42,718 INFO L87 Difference]: Start difference. First operand 11455 states and 16697 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:43,467 INFO L93 Difference]: Finished difference Result 33048 states and 48522 transitions. [2023-11-22 23:54:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:54:43,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2023-11-22 23:54:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:43,505 INFO L225 Difference]: With dead ends: 33048 [2023-11-22 23:54:43,505 INFO L226 Difference]: Without dead ends: 21671 [2023-11-22 23:54:43,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:43,523 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 157 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:43,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 300 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:54:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2023-11-22 23:54:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21139. [2023-11-22 23:54:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21139 states, 16631 states have (on average 1.259575491551921) internal successors, (20948), 17751 states have internal predecessors, (20948), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 23:54:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21139 states to 21139 states and 29128 transitions. [2023-11-22 23:54:44,305 INFO L78 Accepts]: Start accepts. Automaton has 21139 states and 29128 transitions. Word has length 106 [2023-11-22 23:54:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:44,305 INFO L495 AbstractCegarLoop]: Abstraction has 21139 states and 29128 transitions. [2023-11-22 23:54:44,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 23:54:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 21139 states and 29128 transitions. [2023-11-22 23:54:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-22 23:54:44,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:44,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:44,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:44,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:44,532 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:44,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:44,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1787052981, now seen corresponding path program 1 times [2023-11-22 23:54:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:44,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065155111] [2023-11-22 23:54:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:54:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:54:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 23:54:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 23:54:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 23:54:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-22 23:54:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 23:54:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-22 23:54:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 23:54:44,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:44,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065155111] [2023-11-22 23:54:44,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065155111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148042817] [2023-11-22 23:54:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:44,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:44,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:44,684 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:44,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-22 23:54:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:44,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 23:54:44,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:44,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:44,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148042817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:44,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:44,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 23:54:44,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244223489] [2023-11-22 23:54:44,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:44,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:44,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:44,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:44,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:44,774 INFO L87 Difference]: Start difference. First operand 21139 states and 29128 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 23:54:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:45,494 INFO L93 Difference]: Finished difference Result 42166 states and 57974 transitions. [2023-11-22 23:54:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2023-11-22 23:54:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:45,537 INFO L225 Difference]: With dead ends: 42166 [2023-11-22 23:54:45,537 INFO L226 Difference]: Without dead ends: 21379 [2023-11-22 23:54:45,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:45,574 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:45,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21379 states. [2023-11-22 23:54:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21379 to 21283. [2023-11-22 23:54:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.2573472429210135) internal successors, (21092), 17895 states have internal predecessors, (21092), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 23:54:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29272 transitions. [2023-11-22 23:54:46,522 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29272 transitions. Word has length 119 [2023-11-22 23:54:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:46,522 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29272 transitions. [2023-11-22 23:54:46,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 23:54:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29272 transitions. [2023-11-22 23:54:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 23:54:46,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:46,541 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:46,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:46,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-22 23:54:46,752 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:46,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -883405082, now seen corresponding path program 1 times [2023-11-22 23:54:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982881418] [2023-11-22 23:54:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:54:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:54:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 23:54:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-22 23:54:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 23:54:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 23:54:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 23:54:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 23:54:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 23:54:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:46,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982881418] [2023-11-22 23:54:46,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982881418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:46,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761856058] [2023-11-22 23:54:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:46,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:46,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:46,916 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:46,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-22 23:54:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:47,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:47,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:47,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761856058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 23:54:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868657704] [2023-11-22 23:54:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:47,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:47,018 INFO L87 Difference]: Start difference. First operand 21283 states and 29272 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 23:54:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:47,847 INFO L93 Difference]: Finished difference Result 42262 states and 57878 transitions. [2023-11-22 23:54:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:47,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 120 [2023-11-22 23:54:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:47,894 INFO L225 Difference]: With dead ends: 42262 [2023-11-22 23:54:47,895 INFO L226 Difference]: Without dead ends: 21331 [2023-11-22 23:54:47,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:54:47,927 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:47,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 221 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21331 states. [2023-11-22 23:54:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21331 to 21283. [2023-11-22 23:54:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.24876304023845) internal successors, (20948), 17895 states have internal predecessors, (20948), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 23:54:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29128 transitions. [2023-11-22 23:54:48,987 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29128 transitions. Word has length 120 [2023-11-22 23:54:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:48,988 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29128 transitions. [2023-11-22 23:54:48,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 23:54:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29128 transitions. [2023-11-22 23:54:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 23:54:49,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:49,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:49,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-22 23:54:49,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-22 23:54:49,213 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:49,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1018147445, now seen corresponding path program 1 times [2023-11-22 23:54:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764701482] [2023-11-22 23:54:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:54:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:54:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 23:54:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-22 23:54:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 23:54:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 23:54:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 23:54:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 23:54:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 23:54:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764701482] [2023-11-22 23:54:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764701482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000342791] [2023-11-22 23:54:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:49,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:49,343 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:49,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-22 23:54:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:49,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:49,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:49,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000342791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2023-11-22 23:54:49,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605853015] [2023-11-22 23:54:49,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:49,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:49,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:49,536 INFO L87 Difference]: Start difference. First operand 21283 states and 29128 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:54:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:50,304 INFO L93 Difference]: Finished difference Result 42214 states and 57542 transitions. [2023-11-22 23:54:50,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:54:50,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 120 [2023-11-22 23:54:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:50,356 INFO L225 Difference]: With dead ends: 42214 [2023-11-22 23:54:50,356 INFO L226 Difference]: Without dead ends: 21283 [2023-11-22 23:54:50,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:54:50,387 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 275 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:50,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 119 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21283 states. [2023-11-22 23:54:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21283 to 21283. [2023-11-22 23:54:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.2459016393442623) internal successors, (20900), 17895 states have internal predecessors, (20900), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 23:54:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29080 transitions. [2023-11-22 23:54:51,446 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29080 transitions. Word has length 120 [2023-11-22 23:54:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:51,446 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29080 transitions. [2023-11-22 23:54:51,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:54:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29080 transitions. [2023-11-22 23:54:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-22 23:54:51,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:51,464 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:51,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:51,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-22 23:54:51,674 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:51,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1385487328, now seen corresponding path program 1 times [2023-11-22 23:54:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042553779] [2023-11-22 23:54:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:54:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:54:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 23:54:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 23:54:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 23:54:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-22 23:54:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 23:54:51,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042553779] [2023-11-22 23:54:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042553779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377168790] [2023-11-22 23:54:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:51,845 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:51,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-22 23:54:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:51,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:51,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:51,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:51,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377168790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:51,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:51,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-22 23:54:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271952556] [2023-11-22 23:54:51,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:51,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:54:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:54:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:51,933 INFO L87 Difference]: Start difference. First operand 21283 states and 29080 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 23:54:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:52,547 INFO L93 Difference]: Finished difference Result 42742 states and 58214 transitions. [2023-11-22 23:54:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:54:52,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 121 [2023-11-22 23:54:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:52,591 INFO L225 Difference]: With dead ends: 42742 [2023-11-22 23:54:52,591 INFO L226 Difference]: Without dead ends: 21811 [2023-11-22 23:54:52,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:54:52,621 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:52,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21811 states. [2023-11-22 23:54:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21811 to 21619. [2023-11-22 23:54:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21619 states, 17111 states have (on average 1.2466834200222079) internal successors, (21332), 18231 states have internal predecessors, (21332), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 23:54:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21619 states to 21619 states and 29512 transitions. [2023-11-22 23:54:53,545 INFO L78 Accepts]: Start accepts. Automaton has 21619 states and 29512 transitions. Word has length 121 [2023-11-22 23:54:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:53,546 INFO L495 AbstractCegarLoop]: Abstraction has 21619 states and 29512 transitions. [2023-11-22 23:54:53,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 23:54:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 21619 states and 29512 transitions. [2023-11-22 23:54:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-22 23:54:53,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:53,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:53,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-11-22 23:54:53,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-22 23:54:53,767 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:53,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2117454754, now seen corresponding path program 1 times [2023-11-22 23:54:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325345335] [2023-11-22 23:54:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:54:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:54:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 23:54:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 23:54:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 23:54:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 23:54:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 23:54:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-22 23:54:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 23:54:53,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325345335] [2023-11-22 23:54:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325345335] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166513508] [2023-11-22 23:54:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:53,904 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:53,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-22 23:54:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:53,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:53,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:54,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:54,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166513508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:54,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:54,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 23:54:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841656070] [2023-11-22 23:54:54,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:54,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:54,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:54,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:54,066 INFO L87 Difference]: Start difference. First operand 21619 states and 29512 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:54:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:54,959 INFO L93 Difference]: Finished difference Result 42886 states and 58310 transitions. [2023-11-22 23:54:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:54:54,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-11-22 23:54:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:55,010 INFO L225 Difference]: With dead ends: 42886 [2023-11-22 23:54:55,011 INFO L226 Difference]: Without dead ends: 21619 [2023-11-22 23:54:55,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:55,037 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 282 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:55,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 130 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21619 states. [2023-11-22 23:54:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21619 to 21619. [2023-11-22 23:54:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21619 states, 17111 states have (on average 1.2410729939804803) internal successors, (21236), 18231 states have internal predecessors, (21236), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 23:54:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21619 states to 21619 states and 29416 transitions. [2023-11-22 23:54:56,279 INFO L78 Accepts]: Start accepts. Automaton has 21619 states and 29416 transitions. Word has length 121 [2023-11-22 23:54:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:56,279 INFO L495 AbstractCegarLoop]: Abstraction has 21619 states and 29416 transitions. [2023-11-22 23:54:56,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:54:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21619 states and 29416 transitions. [2023-11-22 23:54:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-22 23:54:56,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:56,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:56,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-11-22 23:54:56,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-22 23:54:56,508 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:56,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1139138957, now seen corresponding path program 1 times [2023-11-22 23:54:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:56,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904723110] [2023-11-22 23:54:56,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:54:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:54:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 23:54:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 23:54:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 23:54:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-22 23:54:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-22 23:54:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 23:54:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 23:54:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904723110] [2023-11-22 23:54:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904723110] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:54:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601224034] [2023-11-22 23:54:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:54:56,653 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:54:56,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-22 23:54:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:56,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:54:56,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:54:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:54:56,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:54:56,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601224034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:56,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:54:56,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 23:54:56,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631352268] [2023-11-22 23:54:56,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:56,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:54:56,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:56,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:54:56,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:56,822 INFO L87 Difference]: Start difference. First operand 21619 states and 29416 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:54:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:54:57,585 INFO L93 Difference]: Finished difference Result 42550 states and 57734 transitions. [2023-11-22 23:54:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:54:57,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-11-22 23:54:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:54:57,642 INFO L225 Difference]: With dead ends: 42550 [2023-11-22 23:54:57,642 INFO L226 Difference]: Without dead ends: 21283 [2023-11-22 23:54:57,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:54:57,675 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 198 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:54:57,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 122 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:54:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21283 states. [2023-11-22 23:54:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21283 to 21283. [2023-11-22 23:54:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.237317436661699) internal successors, (20756), 17895 states have internal predecessors, (20756), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 23:54:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 28936 transitions. [2023-11-22 23:54:58,805 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 28936 transitions. Word has length 122 [2023-11-22 23:54:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:54:58,805 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 28936 transitions. [2023-11-22 23:54:58,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:54:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 28936 transitions. [2023-11-22 23:54:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 23:54:58,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:54:58,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:54:58,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-11-22 23:54:59,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:54:59,033 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:54:59,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:54:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1422742400, now seen corresponding path program 1 times [2023-11-22 23:54:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:54:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670290831] [2023-11-22 23:54:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:54:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:54:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:54:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:54:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:54:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:54:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:54:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:54:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:54:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 23:54:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 23:54:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 23:54:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 23:54:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:54:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-22 23:54:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:54:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670290831] [2023-11-22 23:54:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670290831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:54:59,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:54:59,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 23:54:59,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176367682] [2023-11-22 23:54:59,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:54:59,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 23:54:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:54:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 23:54:59,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 23:54:59,120 INFO L87 Difference]: Start difference. First operand 21283 states and 28936 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:55:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:00,149 INFO L93 Difference]: Finished difference Result 44054 states and 59690 transitions. [2023-11-22 23:55:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 23:55:00,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-22 23:55:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:00,208 INFO L225 Difference]: With dead ends: 44054 [2023-11-22 23:55:00,208 INFO L226 Difference]: Without dead ends: 22976 [2023-11-22 23:55:00,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:55:00,242 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 189 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:00,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 201 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 23:55:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22976 states. [2023-11-22 23:55:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22976 to 21456. [2023-11-22 23:55:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21456 states, 16962 states have (on average 1.2342294540738121) internal successors, (20935), 18138 states have internal predecessors, (20935), 1769 states have call successors, (1769), 1453 states have call predecessors, (1769), 2724 states have return successors, (6225), 1888 states have call predecessors, (6225), 1769 states have call successors, (6225) [2023-11-22 23:55:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 28929 transitions. [2023-11-22 23:55:01,256 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 28929 transitions. Word has length 123 [2023-11-22 23:55:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:01,256 INFO L495 AbstractCegarLoop]: Abstraction has 21456 states and 28929 transitions. [2023-11-22 23:55:01,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:55:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 28929 transitions. [2023-11-22 23:55:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 23:55:01,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:01,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:55:01,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-22 23:55:01,272 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:01,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash -538832258, now seen corresponding path program 1 times [2023-11-22 23:55:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:55:01,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679768976] [2023-11-22 23:55:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:55:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:55:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:55:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:55:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:55:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:55:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:55:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:55:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 23:55:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 23:55:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 23:55:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 23:55:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-22 23:55:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:55:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679768976] [2023-11-22 23:55:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679768976] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:55:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927229382] [2023-11-22 23:55:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:01,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:55:01,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:55:01,393 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:55:01,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-22 23:55:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:01,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 23:55:01,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 23:55:01,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:55:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 23:55:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927229382] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:55:01,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:55:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2023-11-22 23:55:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321533115] [2023-11-22 23:55:01,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:55:01,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 23:55:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:55:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 23:55:01,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:55:01,720 INFO L87 Difference]: Start difference. First operand 21456 states and 28929 transitions. Second operand has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-22 23:55:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:04,879 INFO L93 Difference]: Finished difference Result 48244 states and 65468 transitions. [2023-11-22 23:55:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-22 23:55:04,880 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 123 [2023-11-22 23:55:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:04,945 INFO L225 Difference]: With dead ends: 48244 [2023-11-22 23:55:04,945 INFO L226 Difference]: Without dead ends: 26957 [2023-11-22 23:55:04,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 295 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=912, Invalid=4058, Unknown=0, NotChecked=0, Total=4970 [2023-11-22 23:55:04,980 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2555 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2571 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:04,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2571 Valid, 440 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 23:55:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2023-11-22 23:55:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 24657. [2023-11-22 23:55:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24657 states, 19501 states have (on average 1.2094764371057893) internal successors, (23586), 20807 states have internal predecessors, (23586), 2043 states have call successors, (2043), 1695 states have call predecessors, (2043), 3112 states have return successors, (6561), 2178 states have call predecessors, (6561), 2043 states have call successors, (6561) [2023-11-22 23:55:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24657 states to 24657 states and 32190 transitions. [2023-11-22 23:55:06,139 INFO L78 Accepts]: Start accepts. Automaton has 24657 states and 32190 transitions. Word has length 123 [2023-11-22 23:55:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:06,139 INFO L495 AbstractCegarLoop]: Abstraction has 24657 states and 32190 transitions. [2023-11-22 23:55:06,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-22 23:55:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 24657 states and 32190 transitions. [2023-11-22 23:55:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 23:55:06,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:06,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:55:06,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-11-22 23:55:06,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-22 23:55:06,373 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:06,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash 742131714, now seen corresponding path program 1 times [2023-11-22 23:55:06,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:55:06,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661595837] [2023-11-22 23:55:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:55:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:55:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 23:55:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 23:55:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 23:55:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 23:55:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 23:55:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 23:55:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 23:55:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 23:55:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 23:55:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 23:55:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 23:55:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:55:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661595837] [2023-11-22 23:55:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661595837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:55:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111286542] [2023-11-22 23:55:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:06,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:55:06,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:55:06,520 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:55:06,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-22 23:55:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:06,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 23:55:06,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:55:06,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:55:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111286542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:55:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:55:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 23:55:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852240808] [2023-11-22 23:55:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:55:06,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:55:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:55:06,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:55:06,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:55:06,680 INFO L87 Difference]: Start difference. First operand 24657 states and 32190 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:55:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:07,163 INFO L93 Difference]: Finished difference Result 31445 states and 40570 transitions. [2023-11-22 23:55:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:55:07,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-22 23:55:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:07,164 INFO L225 Difference]: With dead ends: 31445 [2023-11-22 23:55:07,164 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 23:55:07,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:55:07,189 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 184 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:07,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:55:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 23:55:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 23:55:07,190 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) [2023-11-22 23:55:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 23:55:07,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2023-11-22 23:55:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:07,192 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 23:55:07,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 23:55:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 23:55:07,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 23:55:07,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 23:55:07,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-11-22 23:55:07,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:55:07,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 23:55:33,821 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: (or (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (< ~b1_val_t~0 1) (not (= ~z_val~0 0)) (< ~z_ev~0 2) (< ~d1_val_t~0 1) (< ~b0_val~0 ~b0_val_t~0) (< ~b0_val_t~0 1) (not (= 0 ~z_val_t~0)) (< ~d1_val~0 ~d1_val_t~0) (< ~d0_val_t~0 1) (< 0 ~comp_m1_i~0) (< ~d0_val~0 ~d0_val_t~0) (< ~b1_val~0 ~b1_val_t~0)) [2023-11-22 23:55:33,821 INFO L899 garLoopResultBuilder]: For program point L129(lines 106 131) no Hoare annotation was computed. [2023-11-22 23:55:33,821 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-11-22 23:55:33,821 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2023-11-22 23:55:33,822 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2023-11-22 23:55:33,822 INFO L899 garLoopResultBuilder]: For program point L275(lines 267 277) no Hoare annotation was computed. [2023-11-22 23:55:33,823 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2023-11-22 23:55:33,823 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 23:55:33,824 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 317 349) the Hoare annotation is: (let ((.cse1 (< |old(~b1_ev~0)| 2)) (.cse18 (< |old(~b0_ev~0)| 2)) (.cse19 (< |old(~d0_ev~0)| 2)) (.cse17 (< |old(~d1_ev~0)| 2)) (.cse0 (< ~b1_val_t~0 1)) (.cse2 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~b0_ev~0 |old(~b0_ev~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~z_ev~0)| ~z_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0))) (.cse3 (< 0 |old(~d1_ev~0)|)) (.cse4 (not (= ~z_val~0 0))) (.cse5 (< ~d1_val_t~0 1)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse7 (< |old(~z_ev~0)| 2)) (.cse8 (< ~b0_val_t~0 1)) (.cse9 (< 0 |old(~d0_ev~0)|)) (.cse10 (not (= 0 ~z_val_t~0))) (.cse11 (< ~d1_val~0 ~d1_val_t~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse13 (< 0 ~comp_m1_i~0)) (.cse20 (< 0 |old(~b1_ev~0)|)) (.cse14 (< ~d0_val~0 ~d0_val_t~0)) (.cse15 (< 0 |old(~b0_ev~0)|)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse16) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse18 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16))) [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2023-11-22 23:55:33,825 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2023-11-22 23:55:33,826 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2023-11-22 23:55:33,826 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 23:55:33,826 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2023-11-22 23:55:33,826 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2023-11-22 23:55:33,826 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2023-11-22 23:55:33,827 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 208 250) the Hoare annotation is: (let ((.cse21 (= |old(~d1_val~0)| ~d1_val~0)) (.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse24 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse25 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse26 (= ~z_val~0 0)) (.cse27 (= |old(~z_ev~0)| ~z_ev~0)) (.cse28 (= |old(~d0_val~0)| ~d0_val~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse30 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse18 (< 0 |old(~b1_ev~0)|)) (.cse5 (< 0 |old(~d1_ev~0)|)) (.cse17 (< 0 |old(~d0_ev~0)|)) (.cse16 (< |old(~b0_ev~0)| 2)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse1 (and .cse21 .cse22 (= ~b0_req_up~0 |old(~b0_req_up~0)|) .cse23 .cse24 (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse25 .cse26 .cse27 .cse28 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse29 .cse30 (= |old(~b0_val~0)| ~b0_val~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (.cse2 (< ~b1_val_t~0 1)) (.cse3 (< |old(~b1_ev~0)| 2)) (.cse4 (not (= |old(~z_val~0)| 0))) (.cse6 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse15 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse19 (< |old(~d1_ev~0)| 2)) (.cse20 (< 0 |old(~b0_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse20) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20) (or (not (= ~comp_m1_st~0 0)) .cse0 (and (= ~b0_req_up~0 1) .cse21 .cse22 .cse23 (= ~d0_req_up~0 1) .cse24 (= ~b0_val~0 0) .cse25 .cse26 .cse27 .cse28 (= ~d1_req_up~0 1) .cse29 .cse30 (= 1 ~b1_req_up~0)) .cse2 .cse3 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse8 (< 0 |old(~z_req_up~0)|) (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) .cse9 (not (= |old(~b1_req_up~0)| 1)) .cse12 .cse13 .cse14 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse20)))) [2023-11-22 23:55:33,827 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2023-11-22 23:55:33,827 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2023-11-22 23:55:33,827 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 23:55:33,827 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 23:55:33,827 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2023-11-22 23:55:33,827 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2023-11-22 23:55:33,827 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2023-11-22 23:55:33,828 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 23:55:33,828 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (let ((.cse2 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse3 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse22 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse4 (= |old(~z_ev~0)| ~z_ev~0)) (.cse5 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse17 (< |old(~b1_ev~0)| 2)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse24 (< |old(~b0_ev~0)| 2)) (.cse25 (< |old(~d0_ev~0)| 2)) (.cse23 (< |old(~d1_ev~0)| 2)) (.cse1 (< ~b1_val_t~0 1)) (.cse18 (and .cse2 .cse3 .cse22 .cse4 .cse5)) (.cse19 (< 0 |old(~d1_ev~0)|)) (.cse6 (not (= ~z_val~0 0))) (.cse7 (< ~d1_val_t~0 1)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse20 (< 0 |old(~d0_ev~0)|)) (.cse11 (not (= 0 ~z_val_t~0))) (.cse12 (< ~d1_val~0 ~d1_val_t~0)) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse26 (< 0 |old(~b1_ev~0)|)) (.cse15 (< ~d0_val~0 ~d0_val_t~0)) (.cse21 (< 0 |old(~b0_ev~0)|)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 (not (= |old(~d0_ev~0)| 1)) .cse1 (and .cse2 .cse3 (= ~d0_ev~0 1) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |old(~d1_ev~0)| 1)) (and .cse3 .cse22 .cse4 (= ~d1_ev~0 1) .cse5) .cse16) (or .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16) (or .cse0 .cse1 .cse6 .cse7 .cse8 (and .cse2 (= ~b0_ev~0 1) .cse22 .cse4 .cse5) .cse9 .cse10 (not (= |old(~b0_ev~0)| 1)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse24 .cse16) (or .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16) (or .cse0 (not (= |old(~b1_ev~0)| 1)) .cse1 .cse6 .cse7 .cse8 .cse9 (and .cse2 .cse3 (= ~b1_ev~0 1) .cse22 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse21 .cse16)))) [2023-11-22 23:55:33,828 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2023-11-22 23:55:33,829 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-22 23:55:33,830 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 23:55:33,830 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-11-22 23:55:33,830 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2023-11-22 23:55:33,830 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 418 460) no Hoare annotation was computed. [2023-11-22 23:55:33,830 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-22 23:55:33,830 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= ~z_req_up~0 0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2023-11-22 23:55:33,830 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2023-11-22 23:55:33,830 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-11-22 23:55:33,830 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2023-11-22 23:55:33,831 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 23:55:33,831 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 23:55:33,831 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2023-11-22 23:55:33,832 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2023-11-22 23:55:33,832 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2023-11-22 23:55:33,832 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse11 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse17 (<= ~b1_ev~0 0)) (.cse19 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= ~z_req_up~0 0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b0_ev~0 0)) (.cse18 (<= 2 ~d1_ev~0)) (.cse10 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (<= ~b0_val_t~0 ~b0_val~0)) (.cse13 (<= 1 ~b1_val_t~0)) (.cse14 (= ~z_val~0 0)) (.cse15 (<= ~d1_val_t~0 ~d1_val~0)) (.cse16 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-22 23:55:33,833 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (<= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= ~z_req_up~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse9 (<= 1 ~b1_val_t~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (<= ~d1_val_t~0 ~d1_val~0)) (.cse12 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~b0_ev~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-11-22 23:55:33,833 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 23:55:33,833 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 279 316) no Hoare annotation was computed. [2023-11-22 23:55:33,833 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 23:55:33,833 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~0) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2023-11-22 23:55:33,833 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0)) (.cse15 (<= 2 ~b1_ev~0)) (.cse16 (<= ~d1_ev~0 0)) (.cse17 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse20 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~z_req_up~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b0_ev~0 0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse20 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse20 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2023-11-22 23:55:33,834 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-11-22 23:55:33,834 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2023-11-22 23:55:33,834 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2023-11-22 23:55:33,834 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-11-22 23:55:33,834 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 251 263) no Hoare annotation was computed. [2023-11-22 23:55:33,834 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse4 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 23:55:33,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-22 23:55:33,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L414(lines 403 416) no Hoare annotation was computed. [2023-11-22 23:55:33,835 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2023-11-22 23:55:33,838 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-11-22 23:55:33,840 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 23:55:33,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:55:33 BoogieIcfgContainer [2023-11-22 23:55:33,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 23:55:33,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 23:55:33,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 23:55:33,910 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 23:55:33,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:54:20" (3/4) ... [2023-11-22 23:55:33,912 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 23:55:33,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-22 23:55:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-22 23:55:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-22 23:55:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-22 23:55:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-22 23:55:33,921 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-22 23:55:33,924 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-22 23:55:33,924 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 23:55:33,925 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 23:55:34,039 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 23:55:34,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 23:55:34,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 23:55:34,040 INFO L158 Benchmark]: Toolchain (without parser) took 73795.88ms. Allocated memory was 165.7MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 108.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2023-11-22 23:55:34,047 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:55:34,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.59ms. Allocated memory is still 165.7MB. Free memory was 108.6MB in the beginning and 95.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 23:55:34,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.84ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 93.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:55:34,051 INFO L158 Benchmark]: Boogie Preprocessor took 34.60ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:55:34,052 INFO L158 Benchmark]: RCFGBuilder took 386.72ms. Allocated memory is still 165.7MB. Free memory was 91.1MB in the beginning and 68.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-22 23:55:34,053 INFO L158 Benchmark]: TraceAbstraction took 72916.73ms. Allocated memory was 165.7MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 68.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2023-11-22 23:55:34,053 INFO L158 Benchmark]: Witness Printer took 131.25ms. Allocated memory is still 5.9GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 23:55:34,054 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.14ms. Allocated memory is still 165.7MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.59ms. Allocated memory is still 165.7MB. Free memory was 108.6MB in the beginning and 95.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.84ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 93.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.60ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.72ms. Allocated memory is still 165.7MB. Free memory was 91.1MB in the beginning and 68.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 72916.73ms. Allocated memory was 165.7MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 68.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 131.25ms. Allocated memory is still 5.9GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 8.5MB). 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: 19]: 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 6 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.8s, OverallIterations: 33, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6524 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6468 mSDsluCounter, 10159 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6294 mSDsCounter, 727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5383 IncrementalHoareTripleChecker+Invalid, 6110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 727 mSolverCounterUnsat, 3865 mSDtfsCounter, 5383 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4336 GetRequests, 3954 SyntacticMatches, 7 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24657occurred in iteration=32, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 9982 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 22549 PreInvPairs, 23349 NumberOfFragments, 10750 HoareAnnotationTreeSize, 22549 FomulaSimplifications, 18192 FormulaSimplificationTreeSizeReduction, 7.3s HoareSimplificationTime, 17 FomulaSimplificationsInter, 109867 FormulaSimplificationTreeSizeReductionInter, 18.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 6588 NumberOfCodeBlocks, 6535 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 6751 ConstructedInterpolants, 0 QuantifiedInterpolants, 15421 SizeOfPredicates, 9 NumberOfNonLiveVariables, 14477 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 66 InterpolantComputations, 32 PerfectInterpolantSequences, 2062/2284 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: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) RESULT: Ultimate proved your program to be correct! [2023-11-22 23:55:34,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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