./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:10:01,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:10:01,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:10:01,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:10:01,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:10:01,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:10:01,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:10:01,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:10:01,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:10:01,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:10:01,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:10:01,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:10:01,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:10:01,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:10:01,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:10:01,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:10:01,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:10:01,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:10:01,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:10:01,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:10:01,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:10:01,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:10:01,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:10:01,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:10:01,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:10:01,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:10:01,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:10:01,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:10:01,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:10:01,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:10:01,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:10:01,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:10:01,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:10:01,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:10:01,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:10:01,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:10:01,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:10:01,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:10:01,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:10:01,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:10:01,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:10:01,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:10:01,870 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-11-11 21:10:02,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:10:02,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:10:02,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:10:02,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:10:02,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:10:02,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-11 21:10:03,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:10:03,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:10:03,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-11 21:10:03,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bf90dac/423044ec15074dff9b0c2e67c36abf9e/FLAG05559f19a [2024-11-11 21:10:03,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bf90dac/423044ec15074dff9b0c2e67c36abf9e [2024-11-11 21:10:03,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:10:03,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:10:03,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:10:03,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:10:03,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:10:03,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:10:03" (1/1) ... [2024-11-11 21:10:03,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d38d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:03, skipping insertion in model container [2024-11-11 21:10:03,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:10:03" (1/1) ... [2024-11-11 21:10:03,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:10:04,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-11-11 21:10:04,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:10:04,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:10:04,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-11-11 21:10:04,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:10:04,218 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:10:04,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04 WrapperNode [2024-11-11 21:10:04,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:10:04,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:10:04,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:10:04,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:10:04,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,255 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 269 [2024-11-11 21:10:04,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:10:04,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:10:04,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:10:04,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:10:04,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,285 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:10:04,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:10:04,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:10:04,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:10:04,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:10:04,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (1/1) ... [2024-11-11 21:10:04,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:10:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:04,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:10:04,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:10:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:10:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 21:10:04,405 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 21:10:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 21:10:04,405 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 21:10:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 21:10:04,405 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 21:10:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 21:10:04,405 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 21:10:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 21:10:04,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 21:10:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:10:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 21:10:04,406 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 21:10:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:10:04,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:10:04,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:10:04,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:10:04,924 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-11 21:10:04,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:10:04,939 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:10:04,939 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-11 21:10:04,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:10:04 BoogieIcfgContainer [2024-11-11 21:10:04,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:10:04,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:10:04,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:10:04,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:10:04,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:10:03" (1/3) ... [2024-11-11 21:10:04,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6098f250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:10:04, skipping insertion in model container [2024-11-11 21:10:04,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:04" (2/3) ... [2024-11-11 21:10:04,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6098f250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:10:04, skipping insertion in model container [2024-11-11 21:10:04,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:10:04" (3/3) ... [2024-11-11 21:10:04,947 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2024-11-11 21:10:04,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:10:04,961 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:10:05,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:10:05,020 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;@247e603c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:10:05,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:10:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 110 states have internal predecessors, (167), 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-11-11 21:10:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:05,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:05,035 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:05,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:05,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash -806611058, now seen corresponding path program 1 times [2024-11-11 21:10:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835838176] [2024-11-11 21:10:05,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:05,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835838176] [2024-11-11 21:10:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835838176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:05,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:05,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:10:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147712078] [2024-11-11 21:10:05,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:05,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:10:05,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:10:05,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:10:05,501 INFO L87 Difference]: Start difference. First operand has 131 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 110 states have internal predecessors, (167), 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 11.4) internal successors, (57), 3 states have internal predecessors, (57), 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-11-11 21:10:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:06,014 INFO L93 Difference]: Finished difference Result 283 states and 431 transitions. [2024-11-11 21:10:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:10:06,017 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), 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 67 [2024-11-11 21:10:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:06,028 INFO L225 Difference]: With dead ends: 283 [2024-11-11 21:10:06,028 INFO L226 Difference]: Without dead ends: 156 [2024-11-11 21:10:06,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 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-11-11 21:10:06,035 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 275 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:06,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 265 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:10:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-11 21:10:06,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-11-11 21:10:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 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-11-11 21:10:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-11-11 21:10:06,099 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 67 [2024-11-11 21:10:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:06,101 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-11-11 21:10:06,101 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), 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-11-11 21:10:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-11-11 21:10:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:06,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:06,104 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:06,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:10:06,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:06,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1240340144, now seen corresponding path program 1 times [2024-11-11 21:10:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691984177] [2024-11-11 21:10:06,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691984177] [2024-11-11 21:10:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691984177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:06,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:10:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663333015] [2024-11-11 21:10:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:06,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:10:06,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:10:06,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:10:06,416 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-11-11 21:10:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:07,149 INFO L93 Difference]: Finished difference Result 415 states and 606 transitions. [2024-11-11 21:10:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:10:07,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 67 [2024-11-11 21:10:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:07,153 INFO L225 Difference]: With dead ends: 415 [2024-11-11 21:10:07,153 INFO L226 Difference]: Without dead ends: 299 [2024-11-11 21:10:07,155 INFO L434 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-11-11 21:10:07,156 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 388 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:07,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 429 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:10:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-11 21:10:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 239. [2024-11-11 21:10:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 200 states have (on average 1.43) internal successors, (286), 202 states have internal predecessors, (286), 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-11-11 21:10:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 339 transitions. [2024-11-11 21:10:07,199 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 339 transitions. Word has length 67 [2024-11-11 21:10:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:07,200 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 339 transitions. [2024-11-11 21:10:07,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-11-11 21:10:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 339 transitions. [2024-11-11 21:10:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:07,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:07,202 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:07,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:10:07,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:07,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1099519889, now seen corresponding path program 1 times [2024-11-11 21:10:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:07,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213275357] [2024-11-11 21:10:07,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:07,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:07,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:07,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:07,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213275357] [2024-11-11 21:10:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213275357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:07,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:07,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115923034] [2024-11-11 21:10:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:07,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:07,389 INFO L87 Difference]: Start difference. First operand 239 states and 339 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-11-11 21:10:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:07,900 INFO L93 Difference]: Finished difference Result 528 states and 762 transitions. [2024-11-11 21:10:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:10:07,902 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), 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 67 [2024-11-11 21:10:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:07,904 INFO L225 Difference]: With dead ends: 528 [2024-11-11 21:10:07,907 INFO L226 Difference]: Without dead ends: 299 [2024-11-11 21:10:07,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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-11-11 21:10:07,910 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 294 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:07,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 393 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:10:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-11 21:10:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 239. [2024-11-11 21:10:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 200 states have (on average 1.42) internal successors, (284), 202 states have internal predecessors, (284), 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-11-11 21:10:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 337 transitions. [2024-11-11 21:10:07,953 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 337 transitions. Word has length 67 [2024-11-11 21:10:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:07,954 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 337 transitions. [2024-11-11 21:10:07,954 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), 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-11-11 21:10:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 337 transitions. [2024-11-11 21:10:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:07,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:07,956 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:07,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:10:07,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:07,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash -223500883, now seen corresponding path program 1 times [2024-11-11 21:10:07,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:07,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170471437] [2024-11-11 21:10:07,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170471437] [2024-11-11 21:10:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170471437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263961792] [2024-11-11 21:10:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:08,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:08,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:08,102 INFO L87 Difference]: Start difference. First operand 239 states and 337 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-11-11 21:10:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:09,093 INFO L93 Difference]: Finished difference Result 704 states and 1001 transitions. [2024-11-11 21:10:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:10:09,094 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), 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 67 [2024-11-11 21:10:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:09,100 INFO L225 Difference]: With dead ends: 704 [2024-11-11 21:10:09,100 INFO L226 Difference]: Without dead ends: 475 [2024-11-11 21:10:09,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:10:09,104 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 404 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:09,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 800 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:10:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-11 21:10:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 346. [2024-11-11 21:10:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 290 states have (on average 1.410344827586207) internal successors, (409), 293 states have internal predecessors, (409), 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-11-11 21:10:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2024-11-11 21:10:09,155 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 67 [2024-11-11 21:10:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:09,156 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2024-11-11 21:10:09,156 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), 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-11-11 21:10:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2024-11-11 21:10:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:09,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:09,162 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:10:09,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 220399791, now seen corresponding path program 1 times [2024-11-11 21:10:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036553582] [2024-11-11 21:10:09,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036553582] [2024-11-11 21:10:09,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036553582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:09,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:09,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:09,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371738162] [2024-11-11 21:10:09,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:09,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:09,328 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-11-11 21:10:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:10,300 INFO L93 Difference]: Finished difference Result 1098 states and 1548 transitions. [2024-11-11 21:10:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:10:10,301 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), 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 67 [2024-11-11 21:10:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:10,305 INFO L225 Difference]: With dead ends: 1098 [2024-11-11 21:10:10,306 INFO L226 Difference]: Without dead ends: 762 [2024-11-11 21:10:10,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:10:10,308 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 413 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:10,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 784 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:10:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-11 21:10:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 559. [2024-11-11 21:10:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 471 states have (on average 1.4097664543524415) internal successors, (664), 476 states have internal predecessors, (664), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-11 21:10:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 783 transitions. [2024-11-11 21:10:10,390 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 783 transitions. Word has length 67 [2024-11-11 21:10:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 783 transitions. [2024-11-11 21:10:10,391 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), 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-11-11 21:10:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 783 transitions. [2024-11-11 21:10:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:10,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:10,394 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:10,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:10:10,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:10,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:10,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1808186319, now seen corresponding path program 1 times [2024-11-11 21:10:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637399125] [2024-11-11 21:10:10,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637399125] [2024-11-11 21:10:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637399125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867991808] [2024-11-11 21:10:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:10,519 INFO L87 Difference]: Start difference. First operand 559 states and 783 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-11-11 21:10:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:10,991 INFO L93 Difference]: Finished difference Result 1199 states and 1705 transitions. [2024-11-11 21:10:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:10:10,992 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), 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 67 [2024-11-11 21:10:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:10,996 INFO L225 Difference]: With dead ends: 1199 [2024-11-11 21:10:10,996 INFO L226 Difference]: Without dead ends: 651 [2024-11-11 21:10:10,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:10:10,999 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 139 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:10,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 547 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:10:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-11 21:10:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 562. [2024-11-11 21:10:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-11 21:10:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2024-11-11 21:10:11,065 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2024-11-11 21:10:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:11,066 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2024-11-11 21:10:11,066 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), 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-11-11 21:10:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2024-11-11 21:10:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:11,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:11,068 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:11,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:10:11,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:11,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1560039825, now seen corresponding path program 1 times [2024-11-11 21:10:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:11,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378559621] [2024-11-11 21:10:11,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:11,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:11,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378559621] [2024-11-11 21:10:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378559621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:11,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:11,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:11,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67659304] [2024-11-11 21:10:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:11,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:11,173 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-11-11 21:10:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:11,702 INFO L93 Difference]: Finished difference Result 1220 states and 1723 transitions. [2024-11-11 21:10:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:10:11,703 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), 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 67 [2024-11-11 21:10:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:11,709 INFO L225 Difference]: With dead ends: 1220 [2024-11-11 21:10:11,709 INFO L226 Difference]: Without dead ends: 669 [2024-11-11 21:10:11,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:10:11,711 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 152 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:11,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 547 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:10:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-11 21:10:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 577. [2024-11-11 21:10:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 489 states have (on average 1.3865030674846626) internal successors, (678), 494 states have internal predecessors, (678), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-11 21:10:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 797 transitions. [2024-11-11 21:10:11,753 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 797 transitions. Word has length 67 [2024-11-11 21:10:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:11,754 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 797 transitions. [2024-11-11 21:10:11,754 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), 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-11-11 21:10:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 797 transitions. [2024-11-11 21:10:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:10:11,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:11,755 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:11,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:10:11,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:11,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1954406611, now seen corresponding path program 1 times [2024-11-11 21:10:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981473300] [2024-11-11 21:10:11,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981473300] [2024-11-11 21:10:11,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981473300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127466363] [2024-11-11 21:10:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:11,917 INFO L87 Difference]: Start difference. First operand 577 states and 797 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-11-11 21:10:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:13,114 INFO L93 Difference]: Finished difference Result 3071 states and 4399 transitions. [2024-11-11 21:10:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:10:13,114 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), 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 67 [2024-11-11 21:10:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:13,126 INFO L225 Difference]: With dead ends: 3071 [2024-11-11 21:10:13,127 INFO L226 Difference]: Without dead ends: 2505 [2024-11-11 21:10:13,130 INFO L434 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-11-11 21:10:13,130 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 1038 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:13,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 770 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:10:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-11 21:10:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1604. [2024-11-11 21:10:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1359 states have (on average 1.3855776306107432) internal successors, (1883), 1377 states have internal predecessors, (1883), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2024-11-11 21:10:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2216 transitions. [2024-11-11 21:10:13,264 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2216 transitions. Word has length 67 [2024-11-11 21:10:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:13,265 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2216 transitions. [2024-11-11 21:10:13,265 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), 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-11-11 21:10:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2216 transitions. [2024-11-11 21:10:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:10:13,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:13,267 INFO L218 NwaCegarLoop]: trace histogram [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-11-11 21:10:13,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:10:13,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:13,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1592488097, now seen corresponding path program 1 times [2024-11-11 21:10:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:13,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221251174] [2024-11-11 21:10:13,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:13,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:10:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 21:10:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221251174] [2024-11-11 21:10:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221251174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:13,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:13,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518494630] [2024-11-11 21:10:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:13,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:13,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:13,362 INFO L87 Difference]: Start difference. First operand 1604 states and 2216 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 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-11-11 21:10:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:13,949 INFO L93 Difference]: Finished difference Result 3504 states and 4917 transitions. [2024-11-11 21:10:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:10:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 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 85 [2024-11-11 21:10:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:13,961 INFO L225 Difference]: With dead ends: 3504 [2024-11-11 21:10:13,961 INFO L226 Difference]: Without dead ends: 1911 [2024-11-11 21:10:13,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:10:13,968 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:13,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 545 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:10:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-11-11 21:10:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1634. [2024-11-11 21:10:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1389 states have (on average 1.3736501079913608) internal successors, (1908), 1407 states have internal predecessors, (1908), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2024-11-11 21:10:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2241 transitions. [2024-11-11 21:10:14,083 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2241 transitions. Word has length 85 [2024-11-11 21:10:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:14,085 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2241 transitions. [2024-11-11 21:10:14,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 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-11-11 21:10:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2241 transitions. [2024-11-11 21:10:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:10:14,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:14,088 INFO L218 NwaCegarLoop]: trace histogram [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-11-11 21:10:14,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:10:14,088 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash 346673949, now seen corresponding path program 1 times [2024-11-11 21:10:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:14,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278650766] [2024-11-11 21:10:14,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:10:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 21:10:14,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:14,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278650766] [2024-11-11 21:10:14,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278650766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:14,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:14,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:14,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825688987] [2024-11-11 21:10:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:14,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:14,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:14,214 INFO L87 Difference]: Start difference. First operand 1634 states and 2241 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 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-11-11 21:10:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:14,680 INFO L93 Difference]: Finished difference Result 3512 states and 4842 transitions. [2024-11-11 21:10:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:10:14,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 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 85 [2024-11-11 21:10:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:14,691 INFO L225 Difference]: With dead ends: 3512 [2024-11-11 21:10:14,691 INFO L226 Difference]: Without dead ends: 1890 [2024-11-11 21:10:14,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:10:14,696 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 344 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:14,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 391 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:10:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-11-11 21:10:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1622. [2024-11-11 21:10:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1377 states have (on average 1.3507625272331154) internal successors, (1860), 1395 states have internal predecessors, (1860), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2024-11-11 21:10:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2193 transitions. [2024-11-11 21:10:14,843 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2193 transitions. Word has length 85 [2024-11-11 21:10:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:14,843 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2193 transitions. [2024-11-11 21:10:14,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 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-11-11 21:10:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2193 transitions. [2024-11-11 21:10:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:10:14,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:14,845 INFO L218 NwaCegarLoop]: trace histogram [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-11-11 21:10:14,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:10:14,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:14,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash -550719329, now seen corresponding path program 1 times [2024-11-11 21:10:14,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:14,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181570201] [2024-11-11 21:10:14,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:10:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 21:10:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181570201] [2024-11-11 21:10:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181570201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:15,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:10:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356529154] [2024-11-11 21:10:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:15,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:10:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:10:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:10:15,003 INFO L87 Difference]: Start difference. First operand 1622 states and 2193 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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-11-11 21:10:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:15,808 INFO L93 Difference]: Finished difference Result 2635 states and 3575 transitions. [2024-11-11 21:10:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:10:15,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 85 [2024-11-11 21:10:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:15,816 INFO L225 Difference]: With dead ends: 2635 [2024-11-11 21:10:15,816 INFO L226 Difference]: Without dead ends: 1633 [2024-11-11 21:10:15,819 INFO L434 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-11-11 21:10:15,819 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 616 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:15,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 517 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:10:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-11 21:10:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1294. [2024-11-11 21:10:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1097 states have (on average 1.3381950774840474) internal successors, (1468), 1108 states have internal predecessors, (1468), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2024-11-11 21:10:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1727 transitions. [2024-11-11 21:10:15,908 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1727 transitions. Word has length 85 [2024-11-11 21:10:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:15,908 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1727 transitions. [2024-11-11 21:10:15,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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-11-11 21:10:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1727 transitions. [2024-11-11 21:10:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:10:15,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:15,910 INFO L218 NwaCegarLoop]: trace histogram [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-11-11 21:10:15,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:10:15,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:15,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash -302572835, now seen corresponding path program 1 times [2024-11-11 21:10:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:15,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382315063] [2024-11-11 21:10:15,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:10:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 21:10:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382315063] [2024-11-11 21:10:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382315063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:10:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007495243] [2024-11-11 21:10:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:16,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:10:16,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:16,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:10:16,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:10:16,070 INFO L87 Difference]: Start difference. First operand 1294 states and 1727 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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-11-11 21:10:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:16,916 INFO L93 Difference]: Finished difference Result 2846 states and 3801 transitions. [2024-11-11 21:10:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 21:10:16,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 85 [2024-11-11 21:10:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:16,936 INFO L225 Difference]: With dead ends: 2846 [2024-11-11 21:10:16,937 INFO L226 Difference]: Without dead ends: 1658 [2024-11-11 21:10:16,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:10:16,940 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 638 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:16,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 516 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:10:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-11 21:10:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1282. [2024-11-11 21:10:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1088 states have (on average 1.333639705882353) internal successors, (1451), 1096 states have internal predecessors, (1451), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2024-11-11 21:10:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1703 transitions. [2024-11-11 21:10:17,028 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1703 transitions. Word has length 85 [2024-11-11 21:10:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1703 transitions. [2024-11-11 21:10:17,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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-11-11 21:10:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1703 transitions. [2024-11-11 21:10:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:10:17,030 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:17,030 INFO L218 NwaCegarLoop]: trace histogram [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-11-11 21:10:17,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:10:17,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:17,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1674380133, now seen corresponding path program 1 times [2024-11-11 21:10:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306112957] [2024-11-11 21:10:17,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:17,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:10:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:10:17,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306112957] [2024-11-11 21:10:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306112957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:10:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656323681] [2024-11-11 21:10:17,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:17,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:17,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:17,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:10:17,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:10:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:10:17,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:10:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:17,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:10:17,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656323681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:17,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:10:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 21:10:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795104233] [2024-11-11 21:10:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:17,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:10:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:17,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:10:17,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:17,262 INFO L87 Difference]: Start difference. First operand 1282 states and 1703 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-11-11 21:10:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:17,432 INFO L93 Difference]: Finished difference Result 2967 states and 4010 transitions. [2024-11-11 21:10:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:10:17,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 85 [2024-11-11 21:10:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:17,442 INFO L225 Difference]: With dead ends: 2967 [2024-11-11 21:10:17,442 INFO L226 Difference]: Without dead ends: 2099 [2024-11-11 21:10:17,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 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-11-11 21:10:17,444 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 131 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:17,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 479 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:10:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-11-11 21:10:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2099. [2024-11-11 21:10:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 1781 states have (on average 1.3239752947782144) internal successors, (2358), 1791 states have internal predecessors, (2358), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2024-11-11 21:10:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2810 transitions. [2024-11-11 21:10:17,600 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2810 transitions. Word has length 85 [2024-11-11 21:10:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:17,601 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2810 transitions. [2024-11-11 21:10:17,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-11-11 21:10:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2810 transitions. [2024-11-11 21:10:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:10:17,602 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:17,603 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2024-11-11 21:10:17,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:10:17,803 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-11-11 21:10:17,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:17,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1173937345, now seen corresponding path program 1 times [2024-11-11 21:10:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988731633] [2024-11-11 21:10:17,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:10:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 21:10:18,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:18,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988731633] [2024-11-11 21:10:18,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988731633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:18,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:18,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039887564] [2024-11-11 21:10:18,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:18,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:18,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:18,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:18,016 INFO L87 Difference]: Start difference. First operand 2099 states and 2810 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 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-11-11 21:10:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:18,963 INFO L93 Difference]: Finished difference Result 6800 states and 9241 transitions. [2024-11-11 21:10:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:10:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 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 100 [2024-11-11 21:10:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:18,984 INFO L225 Difference]: With dead ends: 6800 [2024-11-11 21:10:18,985 INFO L226 Difference]: Without dead ends: 4713 [2024-11-11 21:10:18,990 INFO L434 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-11-11 21:10:18,991 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 512 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:18,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 536 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:10:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2024-11-11 21:10:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4317. [2024-11-11 21:10:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 3653 states have (on average 1.300027374760471) internal successors, (4749), 3707 states have internal predecessors, (4749), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2024-11-11 21:10:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5822 transitions. [2024-11-11 21:10:19,348 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5822 transitions. Word has length 100 [2024-11-11 21:10:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:19,349 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 5822 transitions. [2024-11-11 21:10:19,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 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-11-11 21:10:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5822 transitions. [2024-11-11 21:10:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:10:19,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:19,351 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2024-11-11 21:10:19,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:10:19,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:19,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1145437055, now seen corresponding path program 1 times [2024-11-11 21:10:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:19,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49608031] [2024-11-11 21:10:19,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:19,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:10:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 21:10:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49608031] [2024-11-11 21:10:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49608031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:19,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:10:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395684764] [2024-11-11 21:10:19,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:19,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:10:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:10:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:10:19,412 INFO L87 Difference]: Start difference. First operand 4317 states and 5822 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 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-11-11 21:10:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:19,958 INFO L93 Difference]: Finished difference Result 9188 states and 12384 transitions. [2024-11-11 21:10:19,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:10:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 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 100 [2024-11-11 21:10:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:19,978 INFO L225 Difference]: With dead ends: 9188 [2024-11-11 21:10:19,978 INFO L226 Difference]: Without dead ends: 4882 [2024-11-11 21:10:19,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:10:19,987 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 340 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:19,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 241 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:10:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2024-11-11 21:10:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4312. [2024-11-11 21:10:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 3651 states have (on average 1.2999178307313064) internal successors, (4746), 3704 states have internal predecessors, (4746), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2024-11-11 21:10:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 5812 transitions. [2024-11-11 21:10:20,405 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 5812 transitions. Word has length 100 [2024-11-11 21:10:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:20,406 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 5812 transitions. [2024-11-11 21:10:20,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 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-11-11 21:10:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 5812 transitions. [2024-11-11 21:10:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 21:10:20,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:20,409 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-11 21:10:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:10:20,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -343505380, now seen corresponding path program 1 times [2024-11-11 21:10:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833543495] [2024-11-11 21:10:20,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:10:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 21:10:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833543495] [2024-11-11 21:10:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833543495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:20,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:10:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220843059] [2024-11-11 21:10:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:20,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:10:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:10:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:10:20,497 INFO L87 Difference]: Start difference. First operand 4312 states and 5812 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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-11-11 21:10:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:21,240 INFO L93 Difference]: Finished difference Result 10234 states and 13951 transitions. [2024-11-11 21:10:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:10:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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 102 [2024-11-11 21:10:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:21,287 INFO L225 Difference]: With dead ends: 10234 [2024-11-11 21:10:21,288 INFO L226 Difference]: Without dead ends: 6733 [2024-11-11 21:10:21,297 INFO L434 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-11-11 21:10:21,298 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 439 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:21,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 318 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:10:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2024-11-11 21:10:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 5893. [2024-11-11 21:10:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 4984 states have (on average 1.2951444622792938) internal successors, (6455), 5049 states have internal predecessors, (6455), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2024-11-11 21:10:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 7882 transitions. [2024-11-11 21:10:21,849 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 7882 transitions. Word has length 102 [2024-11-11 21:10:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:21,849 INFO L471 AbstractCegarLoop]: Abstraction has 5893 states and 7882 transitions. [2024-11-11 21:10:21,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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-11-11 21:10:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 7882 transitions. [2024-11-11 21:10:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 21:10:21,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:21,859 INFO L218 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, 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-11-11 21:10:21,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:10:21,860 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:21,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2035116046, now seen corresponding path program 1 times [2024-11-11 21:10:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:21,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876856243] [2024-11-11 21:10:21,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:21,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:10:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:10:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:10:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876856243] [2024-11-11 21:10:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876856243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:10:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34177475] [2024-11-11 21:10:21,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:21,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:21,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:10:21,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:10:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:22,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:10:22,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:10:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:10:22,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:10:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34177475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:22,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:10:22,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-11-11 21:10:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427336156] [2024-11-11 21:10:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:22,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:10:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:10:22,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:22,215 INFO L87 Difference]: Start difference. First operand 5893 states and 7882 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-11-11 21:10:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:22,872 INFO L93 Difference]: Finished difference Result 13842 states and 18528 transitions. [2024-11-11 21:10:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:10:22,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 120 [2024-11-11 21:10:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:22,901 INFO L225 Difference]: With dead ends: 13842 [2024-11-11 21:10:22,902 INFO L226 Difference]: Without dead ends: 7946 [2024-11-11 21:10:22,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 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-11-11 21:10:22,920 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 87 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:22,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 373 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:10:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2024-11-11 21:10:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 7880. [2024-11-11 21:10:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7880 states, 6661 states have (on average 1.291697943251764) internal successors, (8604), 6741 states have internal predecessors, (8604), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2024-11-11 21:10:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7880 states to 7880 states and 10440 transitions. [2024-11-11 21:10:23,640 INFO L78 Accepts]: Start accepts. Automaton has 7880 states and 10440 transitions. Word has length 120 [2024-11-11 21:10:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:23,641 INFO L471 AbstractCegarLoop]: Abstraction has 7880 states and 10440 transitions. [2024-11-11 21:10:23,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-11-11 21:10:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7880 states and 10440 transitions. [2024-11-11 21:10:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 21:10:23,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:23,645 INFO L218 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:23,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:10:23,845 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-11-11 21:10:23,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:23,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:23,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1086589995, now seen corresponding path program 1 times [2024-11-11 21:10:23,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:23,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283320680] [2024-11-11 21:10:23,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:23,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:10:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:10:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:10:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283320680] [2024-11-11 21:10:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283320680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:10:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820487834] [2024-11-11 21:10:23,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:23,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:23,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:23,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:10:23,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:10:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:24,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:10:24,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:10:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 21:10:24,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:10:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820487834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:24,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:10:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 21:10:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31062807] [2024-11-11 21:10:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:24,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:10:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:10:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:24,126 INFO L87 Difference]: Start difference. First operand 7880 states and 10440 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:10:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:24,647 INFO L93 Difference]: Finished difference Result 16618 states and 22420 transitions. [2024-11-11 21:10:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:10:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 122 [2024-11-11 21:10:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:24,679 INFO L225 Difference]: With dead ends: 16618 [2024-11-11 21:10:24,679 INFO L226 Difference]: Without dead ends: 9561 [2024-11-11 21:10:24,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 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-11-11 21:10:24,697 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 122 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:24,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 219 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:10:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9561 states. [2024-11-11 21:10:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9561 to 9454. [2024-11-11 21:10:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9454 states, 8061 states have (on average 1.2647314229003845) internal successors, (10195), 8157 states have internal predecessors, (10195), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2024-11-11 21:10:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 12333 transitions. [2024-11-11 21:10:25,334 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 12333 transitions. Word has length 122 [2024-11-11 21:10:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:25,335 INFO L471 AbstractCegarLoop]: Abstraction has 9454 states and 12333 transitions. [2024-11-11 21:10:25,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:10:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 12333 transitions. [2024-11-11 21:10:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 21:10:25,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:25,339 INFO L218 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, 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-11-11 21:10:25,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:10:25,539 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-11-11 21:10:25,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:25,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash -949299769, now seen corresponding path program 1 times [2024-11-11 21:10:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401007415] [2024-11-11 21:10:25,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:10:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 21:10:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 21:10:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401007415] [2024-11-11 21:10:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401007415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:10:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628730871] [2024-11-11 21:10:25,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:25,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:25,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:10:25,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:10:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:25,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:10:25,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:10:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:25,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:10:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628730871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:25,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:10:25,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 21:10:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456019053] [2024-11-11 21:10:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:25,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:10:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:10:25,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:25,759 INFO L87 Difference]: Start difference. First operand 9454 states and 12333 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-11-11 21:10:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:26,724 INFO L93 Difference]: Finished difference Result 17326 states and 22550 transitions. [2024-11-11 21:10:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:10:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 124 [2024-11-11 21:10:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:26,767 INFO L225 Difference]: With dead ends: 17326 [2024-11-11 21:10:26,768 INFO L226 Difference]: Without dead ends: 10143 [2024-11-11 21:10:26,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 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-11-11 21:10:26,790 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 122 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:26,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:10:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10143 states. [2024-11-11 21:10:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10143 to 10056. [2024-11-11 21:10:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10056 states, 8636 states have (on average 1.2549791570171376) internal successors, (10838), 8738 states have internal predecessors, (10838), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2024-11-11 21:10:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10056 states to 10056 states and 12868 transitions. [2024-11-11 21:10:27,826 INFO L78 Accepts]: Start accepts. Automaton has 10056 states and 12868 transitions. Word has length 124 [2024-11-11 21:10:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:27,827 INFO L471 AbstractCegarLoop]: Abstraction has 10056 states and 12868 transitions. [2024-11-11 21:10:27,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-11-11 21:10:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 10056 states and 12868 transitions. [2024-11-11 21:10:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:10:27,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:27,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:27,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:10:28,038 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-11-11 21:10:28,039 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:28,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1922252635, now seen corresponding path program 1 times [2024-11-11 21:10:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:28,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412695984] [2024-11-11 21:10:28,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:10:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:10:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 21:10:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 21:10:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:28,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412695984] [2024-11-11 21:10:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412695984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:10:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940002980] [2024-11-11 21:10:28,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:28,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:28,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:10:28,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:10:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:28,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:10:28,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:10:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 21:10:28,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:10:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940002980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:10:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-11 21:10:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125828070] [2024-11-11 21:10:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:28,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:10:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:10:28,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:10:28,312 INFO L87 Difference]: Start difference. First operand 10056 states and 12868 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, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:10:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:29,372 INFO L93 Difference]: Finished difference Result 29339 states and 37985 transitions. [2024-11-11 21:10:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:10:29,377 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, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 157 [2024-11-11 21:10:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:29,457 INFO L225 Difference]: With dead ends: 29339 [2024-11-11 21:10:29,457 INFO L226 Difference]: Without dead ends: 19295 [2024-11-11 21:10:29,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:10:29,487 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 150 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:29,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 373 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:10:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19295 states. [2024-11-11 21:10:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19295 to 19280. [2024-11-11 21:10:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19280 states, 16580 states have (on average 1.244270205066345) internal successors, (20630), 16773 states have internal predecessors, (20630), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2024-11-11 21:10:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19280 states to 19280 states and 24759 transitions. [2024-11-11 21:10:30,803 INFO L78 Accepts]: Start accepts. Automaton has 19280 states and 24759 transitions. Word has length 157 [2024-11-11 21:10:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:30,804 INFO L471 AbstractCegarLoop]: Abstraction has 19280 states and 24759 transitions. [2024-11-11 21:10:30,804 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, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:10:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 19280 states and 24759 transitions. [2024-11-11 21:10:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-11 21:10:30,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:30,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:30,835 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-11-11 21:10:31,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:31,020 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:31,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 806131337, now seen corresponding path program 1 times [2024-11-11 21:10:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:31,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178514749] [2024-11-11 21:10:31,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:10:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 21:10:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 21:10:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-11 21:10:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178514749] [2024-11-11 21:10:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178514749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:10:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403848573] [2024-11-11 21:10:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:31,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:10:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:10:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:10:31,095 INFO L87 Difference]: Start difference. First operand 19280 states and 24759 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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-11-11 21:10:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:32,609 INFO L93 Difference]: Finished difference Result 39917 states and 51415 transitions. [2024-11-11 21:10:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:10:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 158 [2024-11-11 21:10:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:32,689 INFO L225 Difference]: With dead ends: 39917 [2024-11-11 21:10:32,690 INFO L226 Difference]: Without dead ends: 20649 [2024-11-11 21:10:32,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 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-11-11 21:10:32,879 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 339 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:32,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 236 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:10:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2024-11-11 21:10:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 18566. [2024-11-11 21:10:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18566 states, 16022 states have (on average 1.241792535264012) internal successors, (19896), 16226 states have internal predecessors, (19896), 1328 states have call successors, (1328), 993 states have call predecessors, (1328), 1215 states have return successors, (2569), 1347 states have call predecessors, (2569), 1328 states have call successors, (2569) [2024-11-11 21:10:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 23793 transitions. [2024-11-11 21:10:34,745 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 23793 transitions. Word has length 158 [2024-11-11 21:10:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 18566 states and 23793 transitions. [2024-11-11 21:10:34,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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-11-11 21:10:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 23793 transitions. [2024-11-11 21:10:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-11 21:10:34,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:34,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:34,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:10:34,756 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:34,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:34,756 INFO L85 PathProgramCache]: Analyzing trace with hash -836659987, now seen corresponding path program 1 times [2024-11-11 21:10:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368848803] [2024-11-11 21:10:34,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:10:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:10:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:10:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-11 21:10:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368848803] [2024-11-11 21:10:34,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368848803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:10:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302129986] [2024-11-11 21:10:34,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:34,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:34,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:34,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:10:34,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 21:10:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:35,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:10:35,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:10:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 21:10:35,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:10:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302129986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:35,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:10:35,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-11 21:10:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774940403] [2024-11-11 21:10:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:35,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:10:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:35,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:10:35,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:10:35,067 INFO L87 Difference]: Start difference. First operand 18566 states and 23793 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-11 21:10:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:36,043 INFO L93 Difference]: Finished difference Result 29293 states and 38546 transitions. [2024-11-11 21:10:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:10:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 159 [2024-11-11 21:10:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:36,119 INFO L225 Difference]: With dead ends: 29293 [2024-11-11 21:10:36,120 INFO L226 Difference]: Without dead ends: 18186 [2024-11-11 21:10:36,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 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-11-11 21:10:36,153 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 120 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:36,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 468 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:10:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18186 states. [2024-11-11 21:10:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18186 to 18124. [2024-11-11 21:10:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18124 states, 15580 states have (on average 1.2297175866495507) internal successors, (19159), 15784 states have internal predecessors, (19159), 1328 states have call successors, (1328), 993 states have call predecessors, (1328), 1215 states have return successors, (2569), 1347 states have call predecessors, (2569), 1328 states have call successors, (2569) [2024-11-11 21:10:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18124 states to 18124 states and 23056 transitions. [2024-11-11 21:10:37,969 INFO L78 Accepts]: Start accepts. Automaton has 18124 states and 23056 transitions. Word has length 159 [2024-11-11 21:10:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:37,969 INFO L471 AbstractCegarLoop]: Abstraction has 18124 states and 23056 transitions. [2024-11-11 21:10:37,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-11 21:10:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 18124 states and 23056 transitions. [2024-11-11 21:10:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-11 21:10:37,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:37,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:37,993 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-11-11 21:10:38,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:38,181 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:38,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1562564278, now seen corresponding path program 1 times [2024-11-11 21:10:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618502773] [2024-11-11 21:10:38,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:10:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:10:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 21:10:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 21:10:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618502773] [2024-11-11 21:10:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618502773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:10:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488721540] [2024-11-11 21:10:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:38,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:10:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:10:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:10:38,285 INFO L87 Difference]: Start difference. First operand 18124 states and 23056 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 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-11-11 21:10:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:39,575 INFO L93 Difference]: Finished difference Result 31318 states and 40022 transitions. [2024-11-11 21:10:39,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:10:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 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 160 [2024-11-11 21:10:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:39,628 INFO L225 Difference]: With dead ends: 31318 [2024-11-11 21:10:39,629 INFO L226 Difference]: Without dead ends: 14908 [2024-11-11 21:10:39,666 INFO L434 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-11-11 21:10:39,666 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 575 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:39,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 540 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:10:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14908 states. [2024-11-11 21:10:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14908 to 13406. [2024-11-11 21:10:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13406 states, 11606 states have (on average 1.2093744614854385) internal successors, (14036), 11756 states have internal predecessors, (14036), 919 states have call successors, (919), 708 states have call predecessors, (919), 880 states have return successors, (1539), 942 states have call predecessors, (1539), 919 states have call successors, (1539) [2024-11-11 21:10:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13406 states to 13406 states and 16494 transitions. [2024-11-11 21:10:40,559 INFO L78 Accepts]: Start accepts. Automaton has 13406 states and 16494 transitions. Word has length 160 [2024-11-11 21:10:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:40,559 INFO L471 AbstractCegarLoop]: Abstraction has 13406 states and 16494 transitions. [2024-11-11 21:10:40,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 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-11-11 21:10:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 13406 states and 16494 transitions. [2024-11-11 21:10:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 21:10:40,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:40,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:40,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:10:40,566 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:40,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1560316271, now seen corresponding path program 1 times [2024-11-11 21:10:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106244898] [2024-11-11 21:10:40,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:10:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:10:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 21:10:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 21:10:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:40,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106244898] [2024-11-11 21:10:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106244898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:10:40,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780098099] [2024-11-11 21:10:40,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:40,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:40,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:40,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:10:40,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 21:10:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:40,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:10:40,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:10:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:10:40,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:10:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780098099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:40,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:10:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-11 21:10:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680507033] [2024-11-11 21:10:40,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:40,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:10:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:10:40,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:10:40,844 INFO L87 Difference]: Start difference. First operand 13406 states and 16494 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-11 21:10:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:41,551 INFO L93 Difference]: Finished difference Result 23848 states and 29765 transitions. [2024-11-11 21:10:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:10:41,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 161 [2024-11-11 21:10:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:41,598 INFO L225 Difference]: With dead ends: 23848 [2024-11-11 21:10:41,598 INFO L226 Difference]: Without dead ends: 13447 [2024-11-11 21:10:41,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 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-11-11 21:10:41,622 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 90 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:41,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:10:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13447 states. [2024-11-11 21:10:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13447 to 13394. [2024-11-11 21:10:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13394 states, 11594 states have (on average 1.1880282904950836) internal successors, (13774), 11744 states have internal predecessors, (13774), 919 states have call successors, (919), 708 states have call predecessors, (919), 880 states have return successors, (1539), 942 states have call predecessors, (1539), 919 states have call successors, (1539) [2024-11-11 21:10:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13394 states to 13394 states and 16232 transitions. [2024-11-11 21:10:42,869 INFO L78 Accepts]: Start accepts. Automaton has 13394 states and 16232 transitions. Word has length 161 [2024-11-11 21:10:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:42,870 INFO L471 AbstractCegarLoop]: Abstraction has 13394 states and 16232 transitions. [2024-11-11 21:10:42,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-11 21:10:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 13394 states and 16232 transitions. [2024-11-11 21:10:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 21:10:42,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:42,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:42,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 21:10:43,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:10:43,078 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:43,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1877011828, now seen corresponding path program 2 times [2024-11-11 21:10:43,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:43,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245921304] [2024-11-11 21:10:43,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 21:10:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:10:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:10:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:10:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:10:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:10:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 21:10:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 21:10:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-11 21:10:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245921304] [2024-11-11 21:10:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245921304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:43,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:43,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:10:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243820684] [2024-11-11 21:10:43,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:43,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:10:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:43,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:10:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:10:43,257 INFO L87 Difference]: Start difference. First operand 13394 states and 16232 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 6 states have internal predecessors, (111), 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-11-11 21:10:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:45,619 INFO L93 Difference]: Finished difference Result 33256 states and 41784 transitions. [2024-11-11 21:10:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 21:10:45,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 6 states have internal predecessors, (111), 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 161 [2024-11-11 21:10:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:45,675 INFO L225 Difference]: With dead ends: 33256 [2024-11-11 21:10:45,675 INFO L226 Difference]: Without dead ends: 19874 [2024-11-11 21:10:45,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:10:45,707 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 966 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:45,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 446 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:10:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19874 states. [2024-11-11 21:10:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19874 to 18621. [2024-11-11 21:10:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18621 states, 16042 states have (on average 1.1393841166936791) internal successors, (18278), 16321 states have internal predecessors, (18278), 1245 states have call successors, (1245), 1032 states have call predecessors, (1245), 1333 states have return successors, (2280), 1268 states have call predecessors, (2280), 1245 states have call successors, (2280) [2024-11-11 21:10:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 21803 transitions. [2024-11-11 21:10:47,017 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 21803 transitions. Word has length 161 [2024-11-11 21:10:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:47,017 INFO L471 AbstractCegarLoop]: Abstraction has 18621 states and 21803 transitions. [2024-11-11 21:10:47,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 6 states have internal predecessors, (111), 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-11-11 21:10:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 21803 transitions. [2024-11-11 21:10:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-11 21:10:47,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:47,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:47,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:10:47,022 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:47,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1133842763, now seen corresponding path program 1 times [2024-11-11 21:10:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093344551] [2024-11-11 21:10:47,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:10:47,046 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 21:10:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:10:47,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 21:10:47,093 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 21:10:47,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:10:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:10:47,098 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:47,338 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:10:47,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:10:47 BoogieIcfgContainer [2024-11-11 21:10:47,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:10:47,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:10:47,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:10:47,342 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:10:47,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:10:04" (3/4) ... [2024-11-11 21:10:47,343 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 21:10:47,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:10:47,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:10:47,466 INFO L158 Benchmark]: Toolchain (without parser) took 43596.02ms. Allocated memory was 167.8MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 136.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-11 21:10:47,467 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:10:47,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.10ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 121.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 21:10:47,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.24ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:10:47,467 INFO L158 Benchmark]: Boogie Preprocessor took 52.33ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 21:10:47,467 INFO L158 Benchmark]: RCFGBuilder took 628.29ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 124.9MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 21:10:47,467 INFO L158 Benchmark]: TraceAbstraction took 42399.32ms. Allocated memory was 167.8MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 123.8MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-11 21:10:47,468 INFO L158 Benchmark]: Witness Printer took 124.45ms. Allocated memory is still 5.8GB. Free memory was 4.5GB in the beginning and 4.4GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 21:10:47,472 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.10ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.10ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 121.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.24ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.33ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 628.29ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 124.9MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 42399.32ms. Allocated memory was 167.8MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 123.8MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 124.45ms. Allocated memory is still 5.8GB. Free memory was 4.5GB in the beginning and 4.4GB in the end (delta: 14.7MB). 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; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 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] [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); 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, \result=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] [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); 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, \result=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] 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); 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, \result=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] 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 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] [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); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \result=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] [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 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] [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 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] [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); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \result=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] [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 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] [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); 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, \result=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] [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); 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, \result=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] [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); 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, \result=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] [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 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] [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 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] [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); 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, \result=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] [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); 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, \result=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] [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); 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, \result=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] [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 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] [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 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] [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, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.1s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9047 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8848 mSDsluCounter, 11579 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7406 mSDsCounter, 1187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9463 IncrementalHoareTripleChecker+Invalid, 10650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1187 mSolverCounterUnsat, 4173 mSDtfsCounter, 9463 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1597 GetRequests, 1349 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19280occurred in iteration=20, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 9858 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3675 NumberOfCodeBlocks, 3675 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3481 ConstructedInterpolants, 0 QuantifiedInterpolants, 6929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 32 InterpolantComputations, 25 PerfectInterpolantSequences, 964/1089 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-11-11 21:10:47,512 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