./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:24:51,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:24:51,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:24:51,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:24:51,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:24:51,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:24:51,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:24:51,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:24:51,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:24:51,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:24:51,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:24:51,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:24:51,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:24:51,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:24:51,580 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:24:51,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:24:51,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:24:51,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:24:51,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:24:51,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:24:51,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:24:51,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:24:51,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:24:51,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:24:51,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:24:51,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:24:51,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:24:51,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:24:51,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:24:51,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:24:51,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:24:51,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:24:51,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:24:51,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:24:51,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:24:51,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:24:51,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:24:51,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:24:51,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:24:51,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:24:51,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:24:51,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:24:51,595 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2024-10-14 03:24:51,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:24:51,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:24:51,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:24:51,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:24:51,819 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:24:51,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-10-14 03:24:53,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:24:53,479 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:24:53,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-10-14 03:24:53,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183ee2596/417795249cc1427988a5976a39dad694/FLAG00576490e [2024-10-14 03:24:53,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183ee2596/417795249cc1427988a5976a39dad694 [2024-10-14 03:24:53,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:24:53,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:24:53,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:24:53,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:24:53,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:24:53,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:24:53" (1/1) ... [2024-10-14 03:24:53,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44798b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:53, skipping insertion in model container [2024-10-14 03:24:53,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:24:53" (1/1) ... [2024-10-14 03:24:53,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:24:54,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-10-14 03:24:54,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:24:54,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:24:54,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-10-14 03:24:54,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:24:54,270 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:24:54,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54 WrapperNode [2024-10-14 03:24:54,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:24:54,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:24:54,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:24:54,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:24:54,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,328 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 269 [2024-10-14 03:24:54,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:24:54,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:24:54,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:24:54,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:24:54,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,372 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:24:54,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:24:54,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:24:54,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:24:54,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:24:54,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (1/1) ... [2024-10-14 03:24:54,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:24:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:24:54,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:24:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:24:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:24:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:24:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:24:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:24:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:24:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:24:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:24:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:24:54,490 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:24:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:24:54,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:24:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:24:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:24:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:24:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:24:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:24:54,578 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:24:54,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:24:54,834 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-14 03:24:54,834 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:24:54,875 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:24:54,876 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 03:24:54,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:24:54 BoogieIcfgContainer [2024-10-14 03:24:54,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:24:54,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:24:54,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:24:54,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:24:54,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:24:53" (1/3) ... [2024-10-14 03:24:54,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a571f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:24:54, skipping insertion in model container [2024-10-14 03:24:54,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:24:54" (2/3) ... [2024-10-14 03:24:54,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a571f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:24:54, skipping insertion in model container [2024-10-14 03:24:54,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:24:54" (3/3) ... [2024-10-14 03:24:54,886 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2024-10-14 03:24:54,911 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:24:54,911 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:24:54,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:24:54,964 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a9bfaba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:24:54,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:24:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 92 states have internal predecessors, (149), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 03:24:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:24:54,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:54,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:54,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:54,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1884876222, now seen corresponding path program 1 times [2024-10-14 03:24:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:54,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006423919] [2024-10-14 03:24:54,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:24:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:24:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:55,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006423919] [2024-10-14 03:24:55,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006423919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:55,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:55,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:24:55,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288108954] [2024-10-14 03:24:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:55,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:24:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:24:55,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:24:55,327 INFO L87 Difference]: Start difference. First operand has 113 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 92 states have internal predecessors, (149), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:55,820 INFO L93 Difference]: Finished difference Result 248 states and 396 transitions. [2024-10-14 03:24:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:24:55,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:24:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:55,833 INFO L225 Difference]: With dead ends: 248 [2024-10-14 03:24:55,834 INFO L226 Difference]: Without dead ends: 139 [2024-10-14 03:24:55,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:24:55,844 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 252 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:55,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 201 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:24:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-14 03:24:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2024-10-14 03:24:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 90 states have internal predecessors, (133), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 03:24:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-14 03:24:55,897 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 59 [2024-10-14 03:24:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:55,897 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-14 03:24:55,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-14 03:24:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:24:55,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:55,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:55,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:24:55,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:55,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash 871751044, now seen corresponding path program 1 times [2024-10-14 03:24:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941867395] [2024-10-14 03:24:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:24:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:24:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941867395] [2024-10-14 03:24:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941867395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:24:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546404146] [2024-10-14 03:24:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:56,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:24:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:24:56,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:24:56,100 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:56,626 INFO L93 Difference]: Finished difference Result 371 states and 562 transitions. [2024-10-14 03:24:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:24:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:24:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:56,631 INFO L225 Difference]: With dead ends: 371 [2024-10-14 03:24:56,634 INFO L226 Difference]: Without dead ends: 268 [2024-10-14 03:24:56,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:24:56,636 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 360 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:56,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 328 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:24:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-14 03:24:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 213. [2024-10-14 03:24:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 176 states have internal predecessors, (260), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-14 03:24:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 313 transitions. [2024-10-14 03:24:56,668 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 313 transitions. Word has length 59 [2024-10-14 03:24:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:56,668 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 313 transitions. [2024-10-14 03:24:56,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 313 transitions. [2024-10-14 03:24:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:24:56,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:56,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:24:56,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:56,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash -549214809, now seen corresponding path program 1 times [2024-10-14 03:24:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784786996] [2024-10-14 03:24:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:24:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:24:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:56,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784786996] [2024-10-14 03:24:56,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784786996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:56,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:56,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150936601] [2024-10-14 03:24:56,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:56,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:56,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:56,808 INFO L87 Difference]: Start difference. First operand 213 states and 313 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:57,627 INFO L93 Difference]: Finished difference Result 635 states and 942 transitions. [2024-10-14 03:24:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:24:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:24:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:57,630 INFO L225 Difference]: With dead ends: 635 [2024-10-14 03:24:57,630 INFO L226 Difference]: Without dead ends: 430 [2024-10-14 03:24:57,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:24:57,632 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 374 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:57,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 608 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:24:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-14 03:24:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 309. [2024-10-14 03:24:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 253 states have (on average 1.482213438735178) internal successors, (375), 256 states have internal predecessors, (375), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-14 03:24:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2024-10-14 03:24:57,670 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 59 [2024-10-14 03:24:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:57,670 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2024-10-14 03:24:57,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2024-10-14 03:24:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:24:57,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:57,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:57,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:24:57,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1389947237, now seen corresponding path program 1 times [2024-10-14 03:24:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:57,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665395296] [2024-10-14 03:24:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:57,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:24:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:57,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:24:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:57,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665395296] [2024-10-14 03:24:57,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665395296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:57,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:57,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380986252] [2024-10-14 03:24:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:57,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:57,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:57,763 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:58,506 INFO L93 Difference]: Finished difference Result 973 states and 1433 transitions. [2024-10-14 03:24:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:24:58,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:24:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:58,510 INFO L225 Difference]: With dead ends: 973 [2024-10-14 03:24:58,511 INFO L226 Difference]: Without dead ends: 672 [2024-10-14 03:24:58,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:24:58,512 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 378 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:58,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 606 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:24:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-14 03:24:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 502. [2024-10-14 03:24:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 412 states have (on average 1.470873786407767) internal successors, (606), 417 states have internal predecessors, (606), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2024-10-14 03:24:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 729 transitions. [2024-10-14 03:24:58,597 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 729 transitions. Word has length 59 [2024-10-14 03:24:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:58,602 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 729 transitions. [2024-10-14 03:24:58,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 729 transitions. [2024-10-14 03:24:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:24:58,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:58,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:58,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:24:58,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1036858855, now seen corresponding path program 1 times [2024-10-14 03:24:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468842267] [2024-10-14 03:24:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:58,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:24:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:24:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468842267] [2024-10-14 03:24:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468842267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:58,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:58,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060461011] [2024-10-14 03:24:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:58,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:58,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:58,834 INFO L87 Difference]: Start difference. First operand 502 states and 729 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:59,155 INFO L93 Difference]: Finished difference Result 1118 states and 1644 transitions. [2024-10-14 03:24:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:24:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:59,161 INFO L225 Difference]: With dead ends: 1118 [2024-10-14 03:24:59,161 INFO L226 Difference]: Without dead ends: 624 [2024-10-14 03:24:59,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:24:59,163 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 320 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:59,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 244 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:24:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-10-14 03:24:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 502. [2024-10-14 03:24:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 412 states have (on average 1.4587378640776698) internal successors, (601), 417 states have internal predecessors, (601), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2024-10-14 03:24:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 724 transitions. [2024-10-14 03:24:59,206 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 724 transitions. Word has length 59 [2024-10-14 03:24:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:59,206 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 724 transitions. [2024-10-14 03:24:59,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 724 transitions. [2024-10-14 03:24:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:24:59,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:59,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:59,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:24:59,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:59,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1930345193, now seen corresponding path program 1 times [2024-10-14 03:24:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420977114] [2024-10-14 03:24:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:24:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:24:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:59,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420977114] [2024-10-14 03:24:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420977114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:59,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:24:59,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908375554] [2024-10-14 03:24:59,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:59,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:24:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:59,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:24:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:24:59,291 INFO L87 Difference]: Start difference. First operand 502 states and 724 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:59,621 INFO L93 Difference]: Finished difference Result 1083 states and 1588 transitions. [2024-10-14 03:24:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:24:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:59,623 INFO L225 Difference]: With dead ends: 1083 [2024-10-14 03:24:59,623 INFO L226 Difference]: Without dead ends: 590 [2024-10-14 03:24:59,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:24:59,625 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 128 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:59,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 352 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:24:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-10-14 03:24:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 504. [2024-10-14 03:24:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 414 states have (on average 1.4468599033816425) internal successors, (599), 419 states have internal predecessors, (599), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2024-10-14 03:24:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 722 transitions. [2024-10-14 03:24:59,651 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 722 transitions. Word has length 59 [2024-10-14 03:24:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:59,652 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 722 transitions. [2024-10-14 03:24:59,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 722 transitions. [2024-10-14 03:24:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:24:59,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:59,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:59,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:24:59,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:59,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1705090581, now seen corresponding path program 1 times [2024-10-14 03:24:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:59,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305192276] [2024-10-14 03:24:59,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:24:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:24:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:59,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:59,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305192276] [2024-10-14 03:24:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305192276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:59,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:24:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40871510] [2024-10-14 03:24:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:59,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:24:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:24:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:24:59,735 INFO L87 Difference]: Start difference. First operand 504 states and 722 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:00,089 INFO L93 Difference]: Finished difference Result 1097 states and 1599 transitions. [2024-10-14 03:25:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:25:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:00,093 INFO L225 Difference]: With dead ends: 1097 [2024-10-14 03:25:00,093 INFO L226 Difference]: Without dead ends: 602 [2024-10-14 03:25:00,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:00,094 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 139 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:00,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 352 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:25:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-10-14 03:25:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 514. [2024-10-14 03:25:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 424 states have (on average 1.4363207547169812) internal successors, (609), 429 states have internal predecessors, (609), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2024-10-14 03:25:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 732 transitions. [2024-10-14 03:25:00,139 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 732 transitions. Word has length 59 [2024-10-14 03:25:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 732 transitions. [2024-10-14 03:25:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2024-10-14 03:25:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:25:00,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:00,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:25:00,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1430330967, now seen corresponding path program 1 times [2024-10-14 03:25:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613756756] [2024-10-14 03:25:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:00,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:00,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:00,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613756756] [2024-10-14 03:25:00,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613756756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:00,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:00,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:00,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316968163] [2024-10-14 03:25:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:00,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:00,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:00,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:00,258 INFO L87 Difference]: Start difference. First operand 514 states and 732 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:01,203 INFO L93 Difference]: Finished difference Result 2774 states and 4122 transitions. [2024-10-14 03:25:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:25:01,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:25:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:01,214 INFO L225 Difference]: With dead ends: 2774 [2024-10-14 03:25:01,214 INFO L226 Difference]: Without dead ends: 2269 [2024-10-14 03:25:01,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:01,217 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 912 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:01,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 488 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2024-10-14 03:25:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1449. [2024-10-14 03:25:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1194 states have (on average 1.4288107202680067) internal successors, (1706), 1212 states have internal predecessors, (1706), 152 states have call successors, (152), 90 states have call predecessors, (152), 102 states have return successors, (201), 150 states have call predecessors, (201), 152 states have call successors, (201) [2024-10-14 03:25:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2059 transitions. [2024-10-14 03:25:01,360 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2059 transitions. Word has length 59 [2024-10-14 03:25:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:01,360 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 2059 transitions. [2024-10-14 03:25:01,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2059 transitions. [2024-10-14 03:25:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:25:01,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:01,362 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:01,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:25:01,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:01,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:01,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1697273882, now seen corresponding path program 1 times [2024-10-14 03:25:01,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:01,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892056397] [2024-10-14 03:25:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:01,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:25:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 03:25:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892056397] [2024-10-14 03:25:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892056397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:01,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:01,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346628319] [2024-10-14 03:25:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:01,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:01,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:01,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:01,419 INFO L87 Difference]: Start difference. First operand 1449 states and 2059 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:01,779 INFO L93 Difference]: Finished difference Result 3172 states and 4600 transitions. [2024-10-14 03:25:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:01,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-10-14 03:25:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:01,786 INFO L225 Difference]: With dead ends: 3172 [2024-10-14 03:25:01,786 INFO L226 Difference]: Without dead ends: 1732 [2024-10-14 03:25:01,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:01,790 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 141 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:01,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 347 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:25:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2024-10-14 03:25:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1469. [2024-10-14 03:25:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1214 states have (on average 1.4176276771004943) internal successors, (1721), 1232 states have internal predecessors, (1721), 152 states have call successors, (152), 90 states have call predecessors, (152), 102 states have return successors, (201), 150 states have call predecessors, (201), 152 states have call successors, (201) [2024-10-14 03:25:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2074 transitions. [2024-10-14 03:25:01,893 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2074 transitions. Word has length 75 [2024-10-14 03:25:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:01,893 INFO L471 AbstractCegarLoop]: Abstraction has 1469 states and 2074 transitions. [2024-10-14 03:25:01,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2074 transitions. [2024-10-14 03:25:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:25:01,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:01,895 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:01,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:25:01,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:01,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 799880604, now seen corresponding path program 1 times [2024-10-14 03:25:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:01,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039755551] [2024-10-14 03:25:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:25:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 03:25:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039755551] [2024-10-14 03:25:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039755551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:02,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:02,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:25:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233095505] [2024-10-14 03:25:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:02,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:25:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:25:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:02,014 INFO L87 Difference]: Start difference. First operand 1469 states and 2074 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:02,801 INFO L93 Difference]: Finished difference Result 2415 states and 3424 transitions. [2024-10-14 03:25:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:25:02,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-10-14 03:25:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:02,809 INFO L225 Difference]: With dead ends: 2415 [2024-10-14 03:25:02,809 INFO L226 Difference]: Without dead ends: 1508 [2024-10-14 03:25:02,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:25:02,813 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 500 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:02,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 452 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:25:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2024-10-14 03:25:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1163. [2024-10-14 03:25:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 961 states have (on average 1.4079084287200831) internal successors, (1353), 972 states have internal predecessors, (1353), 123 states have call successors, (123), 72 states have call predecessors, (123), 78 states have return successors, (146), 120 states have call predecessors, (146), 123 states have call successors, (146) [2024-10-14 03:25:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1622 transitions. [2024-10-14 03:25:02,880 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1622 transitions. Word has length 75 [2024-10-14 03:25:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:02,881 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1622 transitions. [2024-10-14 03:25:02,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1622 transitions. [2024-10-14 03:25:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:25:02,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:02,882 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:02,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:25:02,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -229478694, now seen corresponding path program 1 times [2024-10-14 03:25:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:02,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410768900] [2024-10-14 03:25:02,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:02,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:25:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 03:25:02,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:02,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410768900] [2024-10-14 03:25:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410768900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:02,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:02,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:25:02,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906401698] [2024-10-14 03:25:02,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:02,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:25:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:02,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:25:02,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:02,981 INFO L87 Difference]: Start difference. First operand 1163 states and 1622 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:03,719 INFO L93 Difference]: Finished difference Result 2049 states and 2886 transitions. [2024-10-14 03:25:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:25:03,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-10-14 03:25:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:03,728 INFO L225 Difference]: With dead ends: 2049 [2024-10-14 03:25:03,728 INFO L226 Difference]: Without dead ends: 1166 [2024-10-14 03:25:03,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:25:03,732 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 488 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:03,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 453 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:25:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-10-14 03:25:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 881. [2024-10-14 03:25:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 729 states have (on average 1.412894375857339) internal successors, (1030), 736 states have internal predecessors, (1030), 94 states have call successors, (94), 54 states have call predecessors, (94), 57 states have return successors, (107), 91 states have call predecessors, (107), 94 states have call successors, (107) [2024-10-14 03:25:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1231 transitions. [2024-10-14 03:25:03,793 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1231 transitions. Word has length 75 [2024-10-14 03:25:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:03,793 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1231 transitions. [2024-10-14 03:25:03,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1231 transitions. [2024-10-14 03:25:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:25:03,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:03,794 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:03,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:25:03,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:03,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 430052828, now seen corresponding path program 1 times [2024-10-14 03:25:03,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:03,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757054882] [2024-10-14 03:25:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:03,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:25:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 03:25:03,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757054882] [2024-10-14 03:25:03,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757054882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:03,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:03,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735077966] [2024-10-14 03:25:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:03,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:03,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:03,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:03,907 INFO L87 Difference]: Start difference. First operand 881 states and 1231 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:04,348 INFO L93 Difference]: Finished difference Result 2304 states and 3200 transitions. [2024-10-14 03:25:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:25:04,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-10-14 03:25:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:04,354 INFO L225 Difference]: With dead ends: 2304 [2024-10-14 03:25:04,354 INFO L226 Difference]: Without dead ends: 1433 [2024-10-14 03:25:04,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:25:04,357 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 389 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:04,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 302 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:25:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-10-14 03:25:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1090. [2024-10-14 03:25:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 917 states have (on average 1.3500545256270446) internal successors, (1238), 924 states have internal predecessors, (1238), 100 states have call successors, (100), 69 states have call predecessors, (100), 72 states have return successors, (128), 97 states have call predecessors, (128), 100 states have call successors, (128) [2024-10-14 03:25:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1466 transitions. [2024-10-14 03:25:04,422 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1466 transitions. Word has length 75 [2024-10-14 03:25:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:04,422 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1466 transitions. [2024-10-14 03:25:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1466 transitions. [2024-10-14 03:25:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:25:04,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:04,423 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:04,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:25:04,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash -413952674, now seen corresponding path program 1 times [2024-10-14 03:25:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724754436] [2024-10-14 03:25:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:25:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:25:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724754436] [2024-10-14 03:25:04,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724754436] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:25:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179691346] [2024-10-14 03:25:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:04,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:04,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:04,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:25:04,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:25:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:25:04,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:25:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:04,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:25:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179691346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:04,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:25:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 03:25:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76345470] [2024-10-14 03:25:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:25:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:25:04,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:04,605 INFO L87 Difference]: Start difference. First operand 1090 states and 1466 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 03:25:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:04,802 INFO L93 Difference]: Finished difference Result 2526 states and 3457 transitions. [2024-10-14 03:25:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:25:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2024-10-14 03:25:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:04,811 INFO L225 Difference]: With dead ends: 2526 [2024-10-14 03:25:04,811 INFO L226 Difference]: Without dead ends: 1792 [2024-10-14 03:25:04,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:04,814 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 121 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:04,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 357 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:25:04,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-10-14 03:25:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2024-10-14 03:25:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1510 states have (on average 1.343046357615894) internal successors, (2028), 1519 states have internal predecessors, (2028), 162 states have call successors, (162), 114 states have call predecessors, (162), 119 states have return successors, (235), 159 states have call predecessors, (235), 162 states have call successors, (235) [2024-10-14 03:25:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2425 transitions. [2024-10-14 03:25:04,953 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2425 transitions. Word has length 75 [2024-10-14 03:25:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:04,953 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2425 transitions. [2024-10-14 03:25:04,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 03:25:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2425 transitions. [2024-10-14 03:25:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 03:25:04,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:04,955 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:04,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:25:05,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 03:25:05,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:05,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1163334948, now seen corresponding path program 1 times [2024-10-14 03:25:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:05,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303093098] [2024-10-14 03:25:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:05,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:25:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 03:25:05,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:05,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303093098] [2024-10-14 03:25:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303093098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607489125] [2024-10-14 03:25:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:05,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:05,397 INFO L87 Difference]: Start difference. First operand 1792 states and 2425 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 03:25:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:06,097 INFO L93 Difference]: Finished difference Result 5580 states and 7620 transitions. [2024-10-14 03:25:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:25:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2024-10-14 03:25:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:06,115 INFO L225 Difference]: With dead ends: 5580 [2024-10-14 03:25:06,116 INFO L226 Difference]: Without dead ends: 3798 [2024-10-14 03:25:06,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:25:06,120 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 671 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:06,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 280 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:25:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2024-10-14 03:25:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3318. [2024-10-14 03:25:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2779 states have (on average 1.327455919395466) internal successors, (3689), 2819 states have internal predecessors, (3689), 293 states have call successors, (293), 198 states have call predecessors, (293), 245 states have return successors, (522), 302 states have call predecessors, (522), 293 states have call successors, (522) [2024-10-14 03:25:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4504 transitions. [2024-10-14 03:25:06,412 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4504 transitions. Word has length 87 [2024-10-14 03:25:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:06,412 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 4504 transitions. [2024-10-14 03:25:06,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 03:25:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4504 transitions. [2024-10-14 03:25:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 03:25:06,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:06,414 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:06,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:25:06,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:06,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2073794270, now seen corresponding path program 1 times [2024-10-14 03:25:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364875254] [2024-10-14 03:25:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:25:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 03:25:06,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:06,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364875254] [2024-10-14 03:25:06,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364875254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:06,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:06,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:25:06,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909238940] [2024-10-14 03:25:06,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:25:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:06,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:25:06,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:25:06,470 INFO L87 Difference]: Start difference. First operand 3318 states and 4504 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 03:25:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:07,045 INFO L93 Difference]: Finished difference Result 7151 states and 9670 transitions. [2024-10-14 03:25:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:25:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2024-10-14 03:25:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:07,059 INFO L225 Difference]: With dead ends: 7151 [2024-10-14 03:25:07,059 INFO L226 Difference]: Without dead ends: 3842 [2024-10-14 03:25:07,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:07,067 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 313 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:07,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 186 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:25:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2024-10-14 03:25:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3313. [2024-10-14 03:25:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 2777 states have (on average 1.3273316528628016) internal successors, (3686), 2816 states have internal predecessors, (3686), 290 states have call successors, (290), 198 states have call predecessors, (290), 245 states have return successors, (518), 299 states have call predecessors, (518), 290 states have call successors, (518) [2024-10-14 03:25:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4494 transitions. [2024-10-14 03:25:07,321 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4494 transitions. Word has length 87 [2024-10-14 03:25:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:07,322 INFO L471 AbstractCegarLoop]: Abstraction has 3313 states and 4494 transitions. [2024-10-14 03:25:07,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 03:25:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4494 transitions. [2024-10-14 03:25:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 03:25:07,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:07,327 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:25:07,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:25:07,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:07,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 696510049, now seen corresponding path program 1 times [2024-10-14 03:25:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:07,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973237715] [2024-10-14 03:25:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:25:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 03:25:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973237715] [2024-10-14 03:25:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973237715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:07,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:25:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684534134] [2024-10-14 03:25:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:07,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:25:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:07,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:25:07,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:25:07,467 INFO L87 Difference]: Start difference. First operand 3313 states and 4494 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:25:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:08,788 INFO L93 Difference]: Finished difference Result 8011 states and 10966 transitions. [2024-10-14 03:25:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-10-14 03:25:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:08,807 INFO L225 Difference]: With dead ends: 8011 [2024-10-14 03:25:08,807 INFO L226 Difference]: Without dead ends: 5328 [2024-10-14 03:25:08,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:25:08,812 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 404 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:08,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 247 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2024-10-14 03:25:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4538. [2024-10-14 03:25:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4538 states, 3799 states have (on average 1.3227165043432483) internal successors, (5025), 3848 states have internal predecessors, (5025), 402 states have call successors, (402), 276 states have call predecessors, (402), 336 states have return successors, (684), 414 states have call predecessors, (684), 402 states have call successors, (684) [2024-10-14 03:25:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 6111 transitions. [2024-10-14 03:25:09,151 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 6111 transitions. Word has length 89 [2024-10-14 03:25:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:09,151 INFO L471 AbstractCegarLoop]: Abstraction has 4538 states and 6111 transitions. [2024-10-14 03:25:09,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:25:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 6111 transitions. [2024-10-14 03:25:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:25:09,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:09,154 INFO L215 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, 1, 1, 1] [2024-10-14 03:25:09,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:25:09,154 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash -216901673, now seen corresponding path program 1 times [2024-10-14 03:25:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:09,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694298105] [2024-10-14 03:25:09,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:25:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:25:09,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694298105] [2024-10-14 03:25:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694298105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:25:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682864945] [2024-10-14 03:25:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:09,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:09,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:25:09,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:25:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:25:09,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:25:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:25:09,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:25:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682864945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:09,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:25:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 03:25:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639956296] [2024-10-14 03:25:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:09,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:25:09,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:25:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:09,445 INFO L87 Difference]: Start difference. First operand 4538 states and 6111 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:25:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:09,880 INFO L93 Difference]: Finished difference Result 10339 states and 13915 transitions. [2024-10-14 03:25:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:25:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2024-10-14 03:25:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:09,900 INFO L225 Difference]: With dead ends: 10339 [2024-10-14 03:25:09,900 INFO L226 Difference]: Without dead ends: 5810 [2024-10-14 03:25:09,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:09,921 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:09,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 315 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:25:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2024-10-14 03:25:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 5789. [2024-10-14 03:25:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 4833 states have (on average 1.3167804676184565) internal successors, (6364), 4890 states have internal predecessors, (6364), 530 states have call successors, (530), 360 states have call predecessors, (530), 425 states have return successors, (825), 539 states have call predecessors, (825), 530 states have call successors, (825) [2024-10-14 03:25:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7719 transitions. [2024-10-14 03:25:10,469 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7719 transitions. Word has length 105 [2024-10-14 03:25:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:10,469 INFO L471 AbstractCegarLoop]: Abstraction has 5789 states and 7719 transitions. [2024-10-14 03:25:10,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:25:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7719 transitions. [2024-10-14 03:25:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 03:25:10,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:10,473 INFO L215 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, 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] [2024-10-14 03:25:10,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:25:10,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 03:25:10,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:10,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1504373732, now seen corresponding path program 1 times [2024-10-14 03:25:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398704213] [2024-10-14 03:25:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:25:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:25:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:25:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398704213] [2024-10-14 03:25:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398704213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:25:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130644773] [2024-10-14 03:25:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:10,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:25:10,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:25:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:25:10,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:25:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:10,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:25:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130644773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:25:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 03:25:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15901951] [2024-10-14 03:25:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:10,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:25:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:25:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:10,878 INFO L87 Difference]: Start difference. First operand 5789 states and 7719 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:25:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:11,560 INFO L93 Difference]: Finished difference Result 10396 states and 13874 transitions. [2024-10-14 03:25:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:25:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 108 [2024-10-14 03:25:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:11,582 INFO L225 Difference]: With dead ends: 10396 [2024-10-14 03:25:11,582 INFO L226 Difference]: Without dead ends: 5868 [2024-10-14 03:25:11,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:11,594 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 112 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:11,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 340 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:25:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5868 states. [2024-10-14 03:25:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5868 to 5778. [2024-10-14 03:25:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 4822 states have (on average 1.3079635006221484) internal successors, (6307), 4879 states have internal predecessors, (6307), 530 states have call successors, (530), 360 states have call predecessors, (530), 425 states have return successors, (730), 539 states have call predecessors, (730), 530 states have call successors, (730) [2024-10-14 03:25:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 7567 transitions. [2024-10-14 03:25:12,151 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 7567 transitions. Word has length 108 [2024-10-14 03:25:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:12,151 INFO L471 AbstractCegarLoop]: Abstraction has 5778 states and 7567 transitions. [2024-10-14 03:25:12,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:25:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 7567 transitions. [2024-10-14 03:25:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 03:25:12,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:12,155 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2024-10-14 03:25:12,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 03:25:12,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 03:25:12,355 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:12,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1790084883, now seen corresponding path program 1 times [2024-10-14 03:25:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939307844] [2024-10-14 03:25:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:25:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:25:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 03:25:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 03:25:12,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:12,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939307844] [2024-10-14 03:25:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939307844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:25:12,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281744868] [2024-10-14 03:25:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:12,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:12,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:12,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:25:12,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:25:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:25:12,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:25:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 03:25:12,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:25:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281744868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:12,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:25:12,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-10-14 03:25:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944488293] [2024-10-14 03:25:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:12,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:25:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:25:12,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:12,568 INFO L87 Difference]: Start difference. First operand 5778 states and 7567 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 03:25:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:13,381 INFO L93 Difference]: Finished difference Result 16773 states and 22299 transitions. [2024-10-14 03:25:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:25:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 136 [2024-10-14 03:25:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:13,414 INFO L225 Difference]: With dead ends: 16773 [2024-10-14 03:25:13,414 INFO L226 Difference]: Without dead ends: 11005 [2024-10-14 03:25:13,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:13,427 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 139 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:13,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 314 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:25:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11005 states. [2024-10-14 03:25:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11005 to 10991. [2024-10-14 03:25:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10991 states, 9193 states have (on average 1.2933753943217665) internal successors, (11890), 9297 states have internal predecessors, (11890), 993 states have call successors, (993), 687 states have call predecessors, (993), 804 states have return successors, (1560), 1008 states have call predecessors, (1560), 993 states have call successors, (1560) [2024-10-14 03:25:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10991 states to 10991 states and 14443 transitions. [2024-10-14 03:25:14,355 INFO L78 Accepts]: Start accepts. Automaton has 10991 states and 14443 transitions. Word has length 136 [2024-10-14 03:25:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:14,356 INFO L471 AbstractCegarLoop]: Abstraction has 10991 states and 14443 transitions. [2024-10-14 03:25:14,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 03:25:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10991 states and 14443 transitions. [2024-10-14 03:25:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 03:25:14,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:14,363 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-10-14 03:25:14,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:25:14,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:14,564 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1254459883, now seen corresponding path program 1 times [2024-10-14 03:25:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:14,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639114715] [2024-10-14 03:25:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:25:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 03:25:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 03:25:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:14,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639114715] [2024-10-14 03:25:14,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639114715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:14,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:14,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:25:14,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464717985] [2024-10-14 03:25:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:14,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:25:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:25:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:25:14,643 INFO L87 Difference]: Start difference. First operand 10991 states and 14443 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:25:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:16,284 INFO L93 Difference]: Finished difference Result 23035 states and 30162 transitions. [2024-10-14 03:25:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:25:16,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 137 [2024-10-14 03:25:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:16,333 INFO L225 Difference]: With dead ends: 23035 [2024-10-14 03:25:16,334 INFO L226 Difference]: Without dead ends: 12054 [2024-10-14 03:25:16,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:16,364 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 313 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:16,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 183 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:25:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2024-10-14 03:25:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 10559. [2024-10-14 03:25:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10559 states, 8869 states have (on average 1.2886458450783629) internal successors, (11429), 8979 states have internal predecessors, (11429), 918 states have call successors, (918), 645 states have call predecessors, (918), 771 states have return successors, (1471), 935 states have call predecessors, (1471), 918 states have call successors, (1471) [2024-10-14 03:25:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10559 states to 10559 states and 13818 transitions. [2024-10-14 03:25:17,841 INFO L78 Accepts]: Start accepts. Automaton has 10559 states and 13818 transitions. Word has length 137 [2024-10-14 03:25:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:17,842 INFO L471 AbstractCegarLoop]: Abstraction has 10559 states and 13818 transitions. [2024-10-14 03:25:17,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:25:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10559 states and 13818 transitions. [2024-10-14 03:25:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 03:25:17,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:17,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:17,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:25:17,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:17,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1267645569, now seen corresponding path program 1 times [2024-10-14 03:25:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:17,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770591720] [2024-10-14 03:25:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:17,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:25:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:25:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:25:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-14 03:25:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770591720] [2024-10-14 03:25:17,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770591720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:25:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346486459] [2024-10-14 03:25:17,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:17,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:17,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:17,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:25:17,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:25:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:18,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:25:18,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:25:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:25:18,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:25:18,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346486459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:18,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:25:18,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-10-14 03:25:18,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566555212] [2024-10-14 03:25:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:18,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:25:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:18,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:25:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:18,052 INFO L87 Difference]: Start difference. First operand 10559 states and 13818 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2024-10-14 03:25:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:18,828 INFO L93 Difference]: Finished difference Result 16629 states and 22261 transitions. [2024-10-14 03:25:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:25:18,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 138 [2024-10-14 03:25:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:18,867 INFO L225 Difference]: With dead ends: 16629 [2024-10-14 03:25:18,868 INFO L226 Difference]: Without dead ends: 10523 [2024-10-14 03:25:18,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:18,883 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:18,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 394 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:25:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2024-10-14 03:25:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10477. [2024-10-14 03:25:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10477 states, 8787 states have (on average 1.2700580402867874) internal successors, (11160), 8897 states have internal predecessors, (11160), 918 states have call successors, (918), 645 states have call predecessors, (918), 771 states have return successors, (1471), 935 states have call predecessors, (1471), 918 states have call successors, (1471) [2024-10-14 03:25:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10477 states to 10477 states and 13549 transitions. [2024-10-14 03:25:19,717 INFO L78 Accepts]: Start accepts. Automaton has 10477 states and 13549 transitions. Word has length 138 [2024-10-14 03:25:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:19,718 INFO L471 AbstractCegarLoop]: Abstraction has 10477 states and 13549 transitions. [2024-10-14 03:25:19,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2024-10-14 03:25:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 10477 states and 13549 transitions. [2024-10-14 03:25:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 03:25:19,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:19,722 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:19,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 03:25:19,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:19,923 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:19,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -942763104, now seen corresponding path program 1 times [2024-10-14 03:25:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:19,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078795202] [2024-10-14 03:25:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:25:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:25:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 03:25:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 03:25:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078795202] [2024-10-14 03:25:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078795202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:20,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104339462] [2024-10-14 03:25:20,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:20,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:20,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:20,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:20,016 INFO L87 Difference]: Start difference. First operand 10477 states and 13549 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 03:25:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:20,960 INFO L93 Difference]: Finished difference Result 18286 states and 23578 transitions. [2024-10-14 03:25:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:25:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 139 [2024-10-14 03:25:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:20,989 INFO L225 Difference]: With dead ends: 18286 [2024-10-14 03:25:20,990 INFO L226 Difference]: Without dead ends: 8860 [2024-10-14 03:25:21,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:25:21,007 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 531 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:21,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 414 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:25:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2024-10-14 03:25:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 7787. [2024-10-14 03:25:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7787 states, 6590 states have (on average 1.2438543247344462) internal successors, (8197), 6671 states have internal predecessors, (8197), 634 states have call successors, (634), 462 states have call predecessors, (634), 562 states have return successors, (892), 654 states have call predecessors, (892), 634 states have call successors, (892) [2024-10-14 03:25:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9723 transitions. [2024-10-14 03:25:21,539 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9723 transitions. Word has length 139 [2024-10-14 03:25:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:21,539 INFO L471 AbstractCegarLoop]: Abstraction has 7787 states and 9723 transitions. [2024-10-14 03:25:21,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 03:25:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9723 transitions. [2024-10-14 03:25:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:25:21,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:21,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-14 03:25:21,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:25:21,544 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:21,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -860840103, now seen corresponding path program 1 times [2024-10-14 03:25:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033408324] [2024-10-14 03:25:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:25:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:25:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 03:25:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 03:25:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033408324] [2024-10-14 03:25:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033408324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:25:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821585431] [2024-10-14 03:25:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:21,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:21,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:25:21,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:25:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:25:21,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:25:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:25:21,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:25:21,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821585431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:21,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:25:21,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-10-14 03:25:21,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027013126] [2024-10-14 03:25:21,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:21,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:25:21,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:21,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:25:21,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:21,759 INFO L87 Difference]: Start difference. First operand 7787 states and 9723 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 03:25:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:22,177 INFO L93 Difference]: Finished difference Result 13995 states and 17731 transitions. [2024-10-14 03:25:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:25:22,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 140 [2024-10-14 03:25:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:22,199 INFO L225 Difference]: With dead ends: 13995 [2024-10-14 03:25:22,199 INFO L226 Difference]: Without dead ends: 7805 [2024-10-14 03:25:22,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:22,212 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 86 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:22,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 333 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:25:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2024-10-14 03:25:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7787. [2024-10-14 03:25:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7787 states, 6590 states have (on average 1.2192716236722307) internal successors, (8035), 6671 states have internal predecessors, (8035), 634 states have call successors, (634), 462 states have call predecessors, (634), 562 states have return successors, (892), 654 states have call predecessors, (892), 634 states have call successors, (892) [2024-10-14 03:25:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9561 transitions. [2024-10-14 03:25:22,749 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9561 transitions. Word has length 140 [2024-10-14 03:25:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:22,750 INFO L471 AbstractCegarLoop]: Abstraction has 7787 states and 9561 transitions. [2024-10-14 03:25:22,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 03:25:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9561 transitions. [2024-10-14 03:25:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:25:22,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:22,755 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-14 03:25:22,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 03:25:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:25:22,960 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:22,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash 941490296, now seen corresponding path program 2 times [2024-10-14 03:25:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198281174] [2024-10-14 03:25:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:25:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:25:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:25:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:25:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:25:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 03:25:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:25:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-14 03:25:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198281174] [2024-10-14 03:25:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198281174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:25:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969911665] [2024-10-14 03:25:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:23,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:25:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:25:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:23,107 INFO L87 Difference]: Start difference. First operand 7787 states and 9561 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 03:25:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:25,047 INFO L93 Difference]: Finished difference Result 18571 states and 23383 transitions. [2024-10-14 03:25:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 03:25:25,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 140 [2024-10-14 03:25:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:25,078 INFO L225 Difference]: With dead ends: 18571 [2024-10-14 03:25:25,079 INFO L226 Difference]: Without dead ends: 10794 [2024-10-14 03:25:25,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:25:25,097 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 894 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:25,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 341 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:25:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10794 states. [2024-10-14 03:25:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10794 to 9967. [2024-10-14 03:25:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9967 states, 8400 states have (on average 1.1648809523809525) internal successors, (9785), 8561 states have internal predecessors, (9785), 780 states have call successors, (780), 606 states have call predecessors, (780), 786 states have return successors, (1167), 800 states have call predecessors, (1167), 780 states have call successors, (1167) [2024-10-14 03:25:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9967 states to 9967 states and 11732 transitions. [2024-10-14 03:25:26,218 INFO L78 Accepts]: Start accepts. Automaton has 9967 states and 11732 transitions. Word has length 140 [2024-10-14 03:25:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:26,219 INFO L471 AbstractCegarLoop]: Abstraction has 9967 states and 11732 transitions. [2024-10-14 03:25:26,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 03:25:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 9967 states and 11732 transitions. [2024-10-14 03:25:26,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 03:25:26,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:26,224 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-14 03:25:26,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:25:26,224 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:26,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 593334297, now seen corresponding path program 1 times [2024-10-14 03:25:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:26,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738350921] [2024-10-14 03:25:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:25:26,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:25:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:25:26,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:25:26,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:25:26,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:25:26,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:25:26,270 INFO L407 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] [2024-10-14 03:25:26,365 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:25:26,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:25:26 BoogieIcfgContainer [2024-10-14 03:25:26,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:25:26,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:25:26,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:25:26,368 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:25:26,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:24:54" (3/4) ... [2024-10-14 03:25:26,369 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:25:26,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:25:26,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:25:26,466 INFO L158 Benchmark]: Toolchain (without parser) took 32591.32ms. Allocated memory was 180.4MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 110.8MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-10-14 03:25:26,466 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:25:26,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.77ms. Allocated memory is still 180.4MB. Free memory was 110.6MB in the beginning and 147.8MB in the end (delta: -37.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-10-14 03:25:26,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.36ms. Allocated memory is still 180.4MB. Free memory was 147.8MB in the beginning and 145.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:25:26,467 INFO L158 Benchmark]: Boogie Preprocessor took 71.87ms. Allocated memory is still 180.4MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:25:26,467 INFO L158 Benchmark]: RCFGBuilder took 472.38ms. Allocated memory is still 180.4MB. Free memory was 143.8MB in the beginning and 118.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 03:25:26,467 INFO L158 Benchmark]: TraceAbstraction took 31490.07ms. Allocated memory was 180.4MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 117.8MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-10-14 03:25:26,467 INFO L158 Benchmark]: Witness Printer took 97.82ms. Allocated memory is still 5.0GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 03:25:26,470 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.19ms. Allocated memory is still 180.4MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.77ms. Allocated memory is still 180.4MB. Free memory was 110.6MB in the beginning and 147.8MB in the end (delta: -37.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.36ms. Allocated memory is still 180.4MB. Free memory was 147.8MB in the beginning and 145.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.87ms. Allocated memory is still 180.4MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.38ms. Allocated memory is still 180.4MB. Free memory was 143.8MB in the beginning and 118.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31490.07ms. Allocated memory was 180.4MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 117.8MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 97.82ms. Allocated memory is still 5.0GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.3s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8352 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8153 mSDsluCounter, 8437 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5303 mSDsCounter, 1229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9891 IncrementalHoareTripleChecker+Invalid, 11120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1229 mSolverCounterUnsat, 3134 mSDtfsCounter, 9891 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1339 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10991occurred in iteration=19, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 8109 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2996 NumberOfCodeBlocks, 2996 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2825 ConstructedInterpolants, 0 QuantifiedInterpolants, 5717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2155 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 802/887 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-14 03:25:26,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE