./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:22:16,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:22:16,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:22:16,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:22:16,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:22:16,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:22:16,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:22:16,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:22:16,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:22:16,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:22:16,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:22:16,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:22:16,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:22:16,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:22:16,577 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:22:16,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:22:16,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:22:16,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:22:16,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:22:16,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:22:16,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:22:16,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:22:16,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:22:16,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:22:16,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:22:16,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:22:16,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:22:16,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:22:16,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:22:16,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:22:16,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:22:16,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:22:16,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:22:16,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:22:16,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:22:16,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:22:16,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:22:16,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:22:16,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:22:16,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:22:16,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:22:16,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:22:16,587 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-19 22:22:16,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:22:16,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:22:16,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:22:16,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:22:16,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:22:16,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-19 22:22:18,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:22:18,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:22:18,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-19 22:22:18,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61928b944/bb6427a240ef4370888baa6920ec540e/FLAGccd5b2ad4 [2024-11-19 22:22:18,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61928b944/bb6427a240ef4370888baa6920ec540e [2024-11-19 22:22:18,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:22:18,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:22:18,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:22:18,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:22:18,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:22:18,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:18,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3369490d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18, skipping insertion in model container [2024-11-19 22:22:18,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:18,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:22:18,835 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-19 22:22:18,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:22:18,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:22:18,918 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-19 22:22:18,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:22:18,965 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:22:18,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18 WrapperNode [2024-11-19 22:22:18,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:22:18,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:22:18,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:22:18,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:22:18,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:18,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,016 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 269 [2024-11-19 22:22:19,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:22:19,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:22:19,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:22:19,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:22:19,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,049 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-19 22:22:19,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:22:19,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:22:19,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:22:19,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:22:19,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (1/1) ... [2024-11-19 22:22:19,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:22:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:19,118 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-19 22:22:19,121 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-19 22:22:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:22:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-19 22:22:19,171 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-19 22:22:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-19 22:22:19,171 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-19 22:22:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-19 22:22:19,171 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-19 22:22:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-19 22:22:19,173 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-19 22:22:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-19 22:22:19,173 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-19 22:22:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:22:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-19 22:22:19,173 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-19 22:22:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:22:19,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:22:19,261 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:22:19,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:22:19,619 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-19 22:22:19,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:22:19,635 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:22:19,635 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 22:22:19,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:19 BoogieIcfgContainer [2024-11-19 22:22:19,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:22:19,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:22:19,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:22:19,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:22:19,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:22:18" (1/3) ... [2024-11-19 22:22:19,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3726cdbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:22:19, skipping insertion in model container [2024-11-19 22:22:19,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:18" (2/3) ... [2024-11-19 22:22:19,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3726cdbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:22:19, skipping insertion in model container [2024-11-19 22:22:19,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:19" (3/3) ... [2024-11-19 22:22:19,643 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2024-11-19 22:22:19,659 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:22:19,659 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:22:19,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:22:19,740 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;@56678985, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:22:19,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:22:19,745 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-19 22:22:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:19,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:19,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:19,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:19,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash -806611058, now seen corresponding path program 1 times [2024-11-19 22:22:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468053990] [2024-11-19 22:22:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:20,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:20,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:20,166 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-19 22:22:20,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:20,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468053990] [2024-11-19 22:22:20,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468053990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:20,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:20,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:22:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606167664] [2024-11-19 22:22:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:20,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:22:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:22:20,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:22:20,208 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-19 22:22:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:20,783 INFO L93 Difference]: Finished difference Result 283 states and 431 transitions. [2024-11-19 22:22:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:22:20,787 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-19 22:22:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:20,798 INFO L225 Difference]: With dead ends: 283 [2024-11-19 22:22:20,798 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 22:22:20,804 INFO L431 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-19 22:22:20,810 INFO L432 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-19 22:22:20,812 INFO L433 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-19 22:22:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 22:22:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-11-19 22:22:20,868 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-19 22:22:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-11-19 22:22:20,874 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 67 [2024-11-19 22:22:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:20,875 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-11-19 22:22:20,875 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-19 22:22:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-11-19 22:22:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:20,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:20,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:20,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:22:20,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1240340144, now seen corresponding path program 1 times [2024-11-19 22:22:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549655571] [2024-11-19 22:22:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:21,183 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-19 22:22:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549655571] [2024-11-19 22:22:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549655571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:21,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:22:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901139279] [2024-11-19 22:22:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:21,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:22:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:21,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:22:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:22:21,191 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-19 22:22:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:21,983 INFO L93 Difference]: Finished difference Result 415 states and 606 transitions. [2024-11-19 22:22:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:22:21,984 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-19 22:22:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:21,992 INFO L225 Difference]: With dead ends: 415 [2024-11-19 22:22:21,992 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 22:22:21,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:22:21,995 INFO L432 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-19 22:22:21,995 INFO L433 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-19 22:22:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 22:22:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 239. [2024-11-19 22:22:22,042 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-19 22:22:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 339 transitions. [2024-11-19 22:22:22,045 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 339 transitions. Word has length 67 [2024-11-19 22:22:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:22,048 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 339 transitions. [2024-11-19 22:22:22,048 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-19 22:22:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 339 transitions. [2024-11-19 22:22:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:22,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:22,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:22,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:22:22,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:22,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1099519889, now seen corresponding path program 1 times [2024-11-19 22:22:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634929252] [2024-11-19 22:22:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,203 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-19 22:22:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634929252] [2024-11-19 22:22:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634929252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:22,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:22,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20917234] [2024-11-19 22:22:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:22,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:22,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:22,205 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-19 22:22:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:22,679 INFO L93 Difference]: Finished difference Result 528 states and 762 transitions. [2024-11-19 22:22:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:22:22,679 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-19 22:22:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:22,682 INFO L225 Difference]: With dead ends: 528 [2024-11-19 22:22:22,682 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 22:22:22,684 INFO L431 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-19 22:22:22,685 INFO L432 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-19 22:22:22,685 INFO L433 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-19 22:22:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 22:22:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 239. [2024-11-19 22:22:22,732 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-19 22:22:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 337 transitions. [2024-11-19 22:22:22,736 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 337 transitions. Word has length 67 [2024-11-19 22:22:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:22,737 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 337 transitions. [2024-11-19 22:22:22,737 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-19 22:22:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 337 transitions. [2024-11-19 22:22:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:22,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:22,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:22:22,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -223500883, now seen corresponding path program 1 times [2024-11-19 22:22:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711415118] [2024-11-19 22:22:22,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:22,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:22,888 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-19 22:22:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:22,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711415118] [2024-11-19 22:22:22,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711415118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:22,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:22,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712835577] [2024-11-19 22:22:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:22,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:22,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:22,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:22,891 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-19 22:22:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:23,872 INFO L93 Difference]: Finished difference Result 704 states and 1001 transitions. [2024-11-19 22:22:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:22:23,874 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-19 22:22:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:23,880 INFO L225 Difference]: With dead ends: 704 [2024-11-19 22:22:23,880 INFO L226 Difference]: Without dead ends: 475 [2024-11-19 22:22:23,882 INFO L431 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-19 22:22:23,883 INFO L432 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.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:22:23,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 800 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:22:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-19 22:22:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 346. [2024-11-19 22:22:23,927 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-19 22:22:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2024-11-19 22:22:23,929 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 67 [2024-11-19 22:22:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:23,930 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2024-11-19 22:22:23,930 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-19 22:22:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2024-11-19 22:22:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:23,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:23,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:23,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:22:23,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:23,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 220399791, now seen corresponding path program 1 times [2024-11-19 22:22:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:23,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892791307] [2024-11-19 22:22:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:24,058 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-19 22:22:24,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:24,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892791307] [2024-11-19 22:22:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892791307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:24,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472484684] [2024-11-19 22:22:24,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:24,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:24,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:24,065 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-19 22:22:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:25,014 INFO L93 Difference]: Finished difference Result 1098 states and 1548 transitions. [2024-11-19 22:22:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:22:25,015 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-19 22:22:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:25,021 INFO L225 Difference]: With dead ends: 1098 [2024-11-19 22:22:25,022 INFO L226 Difference]: Without dead ends: 762 [2024-11-19 22:22:25,023 INFO L431 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-19 22:22:25,025 INFO L432 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-19 22:22:25,026 INFO L433 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-19 22:22:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-19 22:22:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 559. [2024-11-19 22:22:25,086 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-19 22:22:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 783 transitions. [2024-11-19 22:22:25,090 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 783 transitions. Word has length 67 [2024-11-19 22:22:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 783 transitions. [2024-11-19 22:22:25,091 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-19 22:22:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 783 transitions. [2024-11-19 22:22:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:25,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:25,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:25,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:22:25,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:25,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1808186319, now seen corresponding path program 1 times [2024-11-19 22:22:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:25,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284515317] [2024-11-19 22:22:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,267 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-19 22:22:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284515317] [2024-11-19 22:22:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284515317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:25,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095942335] [2024-11-19 22:22:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:25,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:25,270 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-19 22:22:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:25,745 INFO L93 Difference]: Finished difference Result 1199 states and 1705 transitions. [2024-11-19 22:22:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:22:25,746 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-19 22:22:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:25,750 INFO L225 Difference]: With dead ends: 1199 [2024-11-19 22:22:25,750 INFO L226 Difference]: Without dead ends: 651 [2024-11-19 22:22:25,752 INFO L431 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-19 22:22:25,753 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:22:25,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 547 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:22:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-19 22:22:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 562. [2024-11-19 22:22:25,792 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-19 22:22:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2024-11-19 22:22:25,797 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2024-11-19 22:22:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:25,797 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2024-11-19 22:22:25,798 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-19 22:22:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2024-11-19 22:22:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:25,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:25,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:25,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:22:25,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1560039825, now seen corresponding path program 1 times [2024-11-19 22:22:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521177006] [2024-11-19 22:22:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:25,900 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-19 22:22:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:25,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521177006] [2024-11-19 22:22:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521177006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407525906] [2024-11-19 22:22:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:25,903 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-19 22:22:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:26,384 INFO L93 Difference]: Finished difference Result 1220 states and 1723 transitions. [2024-11-19 22:22:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:22:26,385 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-19 22:22:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:26,389 INFO L225 Difference]: With dead ends: 1220 [2024-11-19 22:22:26,389 INFO L226 Difference]: Without dead ends: 669 [2024-11-19 22:22:26,390 INFO L431 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-19 22:22:26,394 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:22:26,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 547 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:22:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-19 22:22:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 577. [2024-11-19 22:22:26,438 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-19 22:22:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 797 transitions. [2024-11-19 22:22:26,442 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 797 transitions. Word has length 67 [2024-11-19 22:22:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:26,442 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 797 transitions. [2024-11-19 22:22:26,442 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-19 22:22:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 797 transitions. [2024-11-19 22:22:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:22:26,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:26,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:22:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:22:26,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1954406611, now seen corresponding path program 1 times [2024-11-19 22:22:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559070281] [2024-11-19 22:22:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:26,553 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-19 22:22:26,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:26,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559070281] [2024-11-19 22:22:26,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559070281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:26,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:26,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440255355] [2024-11-19 22:22:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:26,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:26,555 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-19 22:22:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:27,778 INFO L93 Difference]: Finished difference Result 3071 states and 4399 transitions. [2024-11-19 22:22:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 22:22:27,779 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-19 22:22:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:27,789 INFO L225 Difference]: With dead ends: 3071 [2024-11-19 22:22:27,790 INFO L226 Difference]: Without dead ends: 2505 [2024-11-19 22:22:27,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:22:27,793 INFO L432 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-19 22:22:27,793 INFO L433 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-19 22:22:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-19 22:22:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1604. [2024-11-19 22:22:27,903 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-19 22:22:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2216 transitions. [2024-11-19 22:22:27,912 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2216 transitions. Word has length 67 [2024-11-19 22:22:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:27,912 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2216 transitions. [2024-11-19 22:22:27,913 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-19 22:22:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2216 transitions. [2024-11-19 22:22:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 22:22:27,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:27,915 INFO L215 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-19 22:22:27,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:22:27,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:27,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1592488097, now seen corresponding path program 1 times [2024-11-19 22:22:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:27,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787735588] [2024-11-19 22:22:27,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:27,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 22:22:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,012 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-19 22:22:28,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:28,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787735588] [2024-11-19 22:22:28,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787735588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:28,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:28,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:28,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060630957] [2024-11-19 22:22:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:28,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:28,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:28,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:28,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:28,015 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-19 22:22:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:28,593 INFO L93 Difference]: Finished difference Result 3504 states and 4917 transitions. [2024-11-19 22:22:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:22:28,594 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-19 22:22:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:28,605 INFO L225 Difference]: With dead ends: 3504 [2024-11-19 22:22:28,605 INFO L226 Difference]: Without dead ends: 1911 [2024-11-19 22:22:28,611 INFO L431 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-19 22:22:28,613 INFO L432 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-19 22:22:28,613 INFO L433 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-19 22:22:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-11-19 22:22:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1634. [2024-11-19 22:22:28,746 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-19 22:22:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2241 transitions. [2024-11-19 22:22:28,755 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2241 transitions. Word has length 85 [2024-11-19 22:22:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:28,755 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2241 transitions. [2024-11-19 22:22:28,756 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-19 22:22:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2241 transitions. [2024-11-19 22:22:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 22:22:28,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:28,758 INFO L215 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-19 22:22:28,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:22:28,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:28,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash 346673949, now seen corresponding path program 1 times [2024-11-19 22:22:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:28,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444583814] [2024-11-19 22:22:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 22:22:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:28,893 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-19 22:22:28,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:28,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444583814] [2024-11-19 22:22:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444583814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:28,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:28,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356734791] [2024-11-19 22:22:28,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:28,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:28,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:28,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:28,895 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-19 22:22:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:29,351 INFO L93 Difference]: Finished difference Result 3512 states and 4842 transitions. [2024-11-19 22:22:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:22:29,352 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-19 22:22:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:29,361 INFO L225 Difference]: With dead ends: 3512 [2024-11-19 22:22:29,362 INFO L226 Difference]: Without dead ends: 1890 [2024-11-19 22:22:29,365 INFO L431 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-19 22:22:29,366 INFO L432 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-19 22:22:29,367 INFO L433 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-19 22:22:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-11-19 22:22:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1622. [2024-11-19 22:22:29,476 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-19 22:22:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2193 transitions. [2024-11-19 22:22:29,484 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2193 transitions. Word has length 85 [2024-11-19 22:22:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:29,485 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2193 transitions. [2024-11-19 22:22:29,485 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-19 22:22:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2193 transitions. [2024-11-19 22:22:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 22:22:29,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:29,487 INFO L215 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-19 22:22:29,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:22:29,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash -550719329, now seen corresponding path program 1 times [2024-11-19 22:22:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:29,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454472191] [2024-11-19 22:22:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:29,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:29,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:29,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 22:22:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:29,632 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-19 22:22:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454472191] [2024-11-19 22:22:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454472191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:29,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:22:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940006153] [2024-11-19 22:22:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:29,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:22:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:29,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:22:29,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:22:29,635 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-19 22:22:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:30,493 INFO L93 Difference]: Finished difference Result 2635 states and 3575 transitions. [2024-11-19 22:22:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:22:30,494 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-19 22:22:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:30,504 INFO L225 Difference]: With dead ends: 2635 [2024-11-19 22:22:30,504 INFO L226 Difference]: Without dead ends: 1633 [2024-11-19 22:22:30,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:22:30,508 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 616 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-19 22:22:30,508 INFO L433 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-19 22:22:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-19 22:22:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1294. [2024-11-19 22:22:30,660 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-19 22:22:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1727 transitions. [2024-11-19 22:22:30,665 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1727 transitions. Word has length 85 [2024-11-19 22:22:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:30,666 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1727 transitions. [2024-11-19 22:22:30,666 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-19 22:22:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1727 transitions. [2024-11-19 22:22:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 22:22:30,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:30,668 INFO L215 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-19 22:22:30,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:22:30,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:30,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash -302572835, now seen corresponding path program 1 times [2024-11-19 22:22:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:30,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978258588] [2024-11-19 22:22:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 22:22:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:30,796 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-19 22:22:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978258588] [2024-11-19 22:22:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978258588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:22:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644063402] [2024-11-19 22:22:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:30,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:22:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:22:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:22:30,798 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-19 22:22:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:31,600 INFO L93 Difference]: Finished difference Result 2846 states and 3801 transitions. [2024-11-19 22:22:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 22:22:31,600 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-19 22:22:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:31,609 INFO L225 Difference]: With dead ends: 2846 [2024-11-19 22:22:31,610 INFO L226 Difference]: Without dead ends: 1658 [2024-11-19 22:22:31,613 INFO L431 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-19 22:22:31,613 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 638 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:22:31,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 516 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:22:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-19 22:22:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1282. [2024-11-19 22:22:31,707 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-19 22:22:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1703 transitions. [2024-11-19 22:22:31,712 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1703 transitions. Word has length 85 [2024-11-19 22:22:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1703 transitions. [2024-11-19 22:22:31,714 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-19 22:22:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1703 transitions. [2024-11-19 22:22:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 22:22:31,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:31,715 INFO L215 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-19 22:22:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:22:31,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1674380133, now seen corresponding path program 1 times [2024-11-19 22:22:31,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872040190] [2024-11-19 22:22:31,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:31,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 22:22:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,803 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-19 22:22:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872040190] [2024-11-19 22:22:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872040190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:22:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669599808] [2024-11-19 22:22:31,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:31,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:22:31,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:31,806 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-19 22:22:31,808 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-19 22:22:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:31,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:22:31,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:22:31,928 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-19 22:22:31,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:22:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669599808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:31,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:22:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 22:22:31,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885272931] [2024-11-19 22:22:31,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:31,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:22:31,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:22:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:31,930 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-19 22:22:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:32,079 INFO L93 Difference]: Finished difference Result 2967 states and 4010 transitions. [2024-11-19 22:22:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:22:32,080 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-19 22:22:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:32,090 INFO L225 Difference]: With dead ends: 2967 [2024-11-19 22:22:32,090 INFO L226 Difference]: Without dead ends: 2099 [2024-11-19 22:22:32,094 INFO L431 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-19 22:22:32,094 INFO L432 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-19 22:22:32,094 INFO L433 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-19 22:22:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-11-19 22:22:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2099. [2024-11-19 22:22:32,266 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-19 22:22:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2810 transitions. [2024-11-19 22:22:32,274 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2810 transitions. Word has length 85 [2024-11-19 22:22:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:32,274 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2810 transitions. [2024-11-19 22:22:32,274 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-19 22:22:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2810 transitions. [2024-11-19 22:22:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 22:22:32,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:32,276 INFO L215 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-19 22:22:32,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:22:32,476 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-19 22:22:32,477 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:32,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1173937345, now seen corresponding path program 1 times [2024-11-19 22:22:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345179735] [2024-11-19 22:22:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:22:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:32,696 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-19 22:22:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345179735] [2024-11-19 22:22:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345179735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:32,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:22:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909054935] [2024-11-19 22:22:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:32,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:22:32,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:22:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:32,699 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-19 22:22:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:33,581 INFO L93 Difference]: Finished difference Result 6800 states and 9241 transitions. [2024-11-19 22:22:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:22:33,582 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-19 22:22:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:33,606 INFO L225 Difference]: With dead ends: 6800 [2024-11-19 22:22:33,606 INFO L226 Difference]: Without dead ends: 4713 [2024-11-19 22:22:33,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:22:33,614 INFO L432 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:22:33,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 536 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:22:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2024-11-19 22:22:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4317. [2024-11-19 22:22:33,986 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-19 22:22:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5822 transitions. [2024-11-19 22:22:34,000 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5822 transitions. Word has length 100 [2024-11-19 22:22:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:34,001 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 5822 transitions. [2024-11-19 22:22:34,001 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-19 22:22:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5822 transitions. [2024-11-19 22:22:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 22:22:34,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:34,004 INFO L215 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-19 22:22:34,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:22:34,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:34,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1145437055, now seen corresponding path program 1 times [2024-11-19 22:22:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673770569] [2024-11-19 22:22:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:22:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:34,061 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-19 22:22:34,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:34,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673770569] [2024-11-19 22:22:34,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673770569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:34,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:34,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:22:34,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26555750] [2024-11-19 22:22:34,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:34,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:22:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:22:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:22:34,063 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-19 22:22:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:34,641 INFO L93 Difference]: Finished difference Result 9188 states and 12384 transitions. [2024-11-19 22:22:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:22:34,642 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-19 22:22:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:34,669 INFO L225 Difference]: With dead ends: 9188 [2024-11-19 22:22:34,669 INFO L226 Difference]: Without dead ends: 4882 [2024-11-19 22:22:34,681 INFO L431 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-19 22:22:34,682 INFO L432 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-19 22:22:34,682 INFO L433 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-19 22:22:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2024-11-19 22:22:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4312. [2024-11-19 22:22:35,139 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-19 22:22:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 5812 transitions. [2024-11-19 22:22:35,158 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 5812 transitions. Word has length 100 [2024-11-19 22:22:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:35,158 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 5812 transitions. [2024-11-19 22:22:35,159 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-19 22:22:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 5812 transitions. [2024-11-19 22:22:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 22:22:35,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:35,161 INFO L215 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-19 22:22:35,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:22:35,161 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:35,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -343505380, now seen corresponding path program 1 times [2024-11-19 22:22:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891491481] [2024-11-19 22:22:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:22:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:35,244 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-19 22:22:35,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891491481] [2024-11-19 22:22:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891491481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:35,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:35,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:22:35,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70881943] [2024-11-19 22:22:35,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:35,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:22:35,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:35,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:22:35,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:22:35,251 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-19 22:22:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:35,976 INFO L93 Difference]: Finished difference Result 10234 states and 13951 transitions. [2024-11-19 22:22:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:22:35,977 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-19 22:22:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:36,009 INFO L225 Difference]: With dead ends: 10234 [2024-11-19 22:22:36,009 INFO L226 Difference]: Without dead ends: 6733 [2024-11-19 22:22:36,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:22:36,020 INFO L432 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-19 22:22:36,021 INFO L433 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-19 22:22:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2024-11-19 22:22:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 5893. [2024-11-19 22:22:36,430 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-19 22:22:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 7882 transitions. [2024-11-19 22:22:36,450 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 7882 transitions. Word has length 102 [2024-11-19 22:22:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:36,451 INFO L471 AbstractCegarLoop]: Abstraction has 5893 states and 7882 transitions. [2024-11-19 22:22:36,451 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-19 22:22:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 7882 transitions. [2024-11-19 22:22:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 22:22:36,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:36,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 22:22:36,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:22:36,455 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:36,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2035116046, now seen corresponding path program 1 times [2024-11-19 22:22:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305294941] [2024-11-19 22:22:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 22:22:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 22:22:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,564 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-19 22:22:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305294941] [2024-11-19 22:22:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305294941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:22:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560332432] [2024-11-19 22:22:36,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:22:36,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:36,566 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-19 22:22:36,569 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-19 22:22:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:36,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:22:36,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:22:36,756 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-19 22:22:36,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:22:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560332432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:36,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:22:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-11-19 22:22:36,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329659849] [2024-11-19 22:22:36,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:22:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:36,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:22:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:36,759 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-19 22:22:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:37,354 INFO L93 Difference]: Finished difference Result 13842 states and 18528 transitions. [2024-11-19 22:22:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:22:37,355 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-19 22:22:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:37,383 INFO L225 Difference]: With dead ends: 13842 [2024-11-19 22:22:37,383 INFO L226 Difference]: Without dead ends: 7946 [2024-11-19 22:22:37,398 INFO L431 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-19 22:22:37,398 INFO L432 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-19 22:22:37,398 INFO L433 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-19 22:22:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2024-11-19 22:22:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 7880. [2024-11-19 22:22:37,938 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-19 22:22:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7880 states to 7880 states and 10440 transitions. [2024-11-19 22:22:37,964 INFO L78 Accepts]: Start accepts. Automaton has 7880 states and 10440 transitions. Word has length 120 [2024-11-19 22:22:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:37,964 INFO L471 AbstractCegarLoop]: Abstraction has 7880 states and 10440 transitions. [2024-11-19 22:22:37,965 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-19 22:22:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7880 states and 10440 transitions. [2024-11-19 22:22:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 22:22:37,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:37,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 22:22:37,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 22:22:38,170 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-19 22:22:38,171 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:38,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1086589995, now seen corresponding path program 1 times [2024-11-19 22:22:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:38,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783205294] [2024-11-19 22:22:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 22:22:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 22:22:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,274 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-19 22:22:38,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:38,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783205294] [2024-11-19 22:22:38,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783205294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:22:38,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497762158] [2024-11-19 22:22:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:38,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:22:38,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:38,278 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-19 22:22:38,279 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-19 22:22:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:38,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 22:22:38,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:22:38,431 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-19 22:22:38,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:22:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497762158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:22:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 22:22:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744125408] [2024-11-19 22:22:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:22:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:38,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:22:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:38,434 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-19 22:22:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:39,102 INFO L93 Difference]: Finished difference Result 16618 states and 22420 transitions. [2024-11-19 22:22:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:22:39,103 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-19 22:22:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:39,144 INFO L225 Difference]: With dead ends: 16618 [2024-11-19 22:22:39,144 INFO L226 Difference]: Without dead ends: 9561 [2024-11-19 22:22:39,164 INFO L431 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-19 22:22:39,165 INFO L432 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-19 22:22:39,165 INFO L433 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-19 22:22:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9561 states. [2024-11-19 22:22:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9561 to 9454. [2024-11-19 22:22:40,032 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-19 22:22:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 12333 transitions. [2024-11-19 22:22:40,075 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 12333 transitions. Word has length 122 [2024-11-19 22:22:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:40,076 INFO L471 AbstractCegarLoop]: Abstraction has 9454 states and 12333 transitions. [2024-11-19 22:22:40,076 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-19 22:22:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 12333 transitions. [2024-11-19 22:22:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 22:22:40,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:40,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 22:22:40,088 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-19 22:22:40,284 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-19 22:22:40,285 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:40,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash -949299769, now seen corresponding path program 1 times [2024-11-19 22:22:40,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:40,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664877831] [2024-11-19 22:22:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:40,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 22:22:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 22:22:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,392 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-19 22:22:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664877831] [2024-11-19 22:22:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664877831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:22:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730415023] [2024-11-19 22:22:40,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:40,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:22:40,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:40,396 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-19 22:22:40,397 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-19 22:22:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:40,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:22:40,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:22:40,516 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-19 22:22:40,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:22:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730415023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:40,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:22:40,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 22:22:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380344067] [2024-11-19 22:22:40,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:40,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:22:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:22:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:22:40,520 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-19 22:22:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:41,305 INFO L93 Difference]: Finished difference Result 17326 states and 22550 transitions. [2024-11-19 22:22:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:22:41,306 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-19 22:22:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:41,346 INFO L225 Difference]: With dead ends: 17326 [2024-11-19 22:22:41,346 INFO L226 Difference]: Without dead ends: 10143 [2024-11-19 22:22:41,367 INFO L431 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-19 22:22:41,368 INFO L432 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-19 22:22:41,368 INFO L433 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-19 22:22:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10143 states. [2024-11-19 22:22:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10143 to 10056. [2024-11-19 22:22:42,099 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-19 22:22:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10056 states to 10056 states and 12868 transitions. [2024-11-19 22:22:42,133 INFO L78 Accepts]: Start accepts. Automaton has 10056 states and 12868 transitions. Word has length 124 [2024-11-19 22:22:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:42,134 INFO L471 AbstractCegarLoop]: Abstraction has 10056 states and 12868 transitions. [2024-11-19 22:22:42,134 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-19 22:22:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 10056 states and 12868 transitions. [2024-11-19 22:22:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 22:22:42,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:42,140 INFO L215 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-19 22:22:42,149 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-19 22:22:42,341 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-19 22:22:42,341 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:42,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1922252635, now seen corresponding path program 1 times [2024-11-19 22:22:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430180630] [2024-11-19 22:22:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 22:22:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 22:22:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-19 22:22:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,456 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-19 22:22:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430180630] [2024-11-19 22:22:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430180630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:22:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111232300] [2024-11-19 22:22:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:22:42,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:42,460 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-19 22:22:42,462 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-19 22:22:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:42,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 22:22:42,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:22:42,563 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-19 22:22:42,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:22:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111232300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:22:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-19 22:22:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548561794] [2024-11-19 22:22:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:42,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:22:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:22:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:22:42,566 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-19 22:22:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:43,819 INFO L93 Difference]: Finished difference Result 29339 states and 37985 transitions. [2024-11-19 22:22:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:22:43,820 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-19 22:22:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:43,892 INFO L225 Difference]: With dead ends: 29339 [2024-11-19 22:22:43,893 INFO L226 Difference]: Without dead ends: 19295 [2024-11-19 22:22:43,918 INFO L431 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-19 22:22:43,918 INFO L432 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-19 22:22:43,919 INFO L433 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-19 22:22:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19295 states. [2024-11-19 22:22:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19295 to 19280. [2024-11-19 22:22:45,848 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-19 22:22:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19280 states to 19280 states and 24759 transitions. [2024-11-19 22:22:45,893 INFO L78 Accepts]: Start accepts. Automaton has 19280 states and 24759 transitions. Word has length 157 [2024-11-19 22:22:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:45,893 INFO L471 AbstractCegarLoop]: Abstraction has 19280 states and 24759 transitions. [2024-11-19 22:22:45,893 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-19 22:22:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19280 states and 24759 transitions. [2024-11-19 22:22:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 22:22:45,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:45,903 INFO L215 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-19 22:22:45,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 22:22:46,104 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-19 22:22:46,104 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:46,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 806131337, now seen corresponding path program 1 times [2024-11-19 22:22:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576373246] [2024-11-19 22:22:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 22:22:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 22:22:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-19 22:22:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:46,179 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-19 22:22:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:46,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576373246] [2024-11-19 22:22:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576373246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:22:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592094741] [2024-11-19 22:22:46,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:46,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:22:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:22:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:22:46,182 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-19 22:22:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:47,610 INFO L93 Difference]: Finished difference Result 39917 states and 51415 transitions. [2024-11-19 22:22:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:22:47,610 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-19 22:22:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:47,686 INFO L225 Difference]: With dead ends: 39917 [2024-11-19 22:22:47,687 INFO L226 Difference]: Without dead ends: 20649 [2024-11-19 22:22:47,722 INFO L431 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-19 22:22:47,723 INFO L432 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-19 22:22:47,723 INFO L433 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-19 22:22:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2024-11-19 22:22:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 18566. [2024-11-19 22:22:48,911 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-19 22:22:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 23793 transitions. [2024-11-19 22:22:48,958 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 23793 transitions. Word has length 158 [2024-11-19 22:22:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:48,958 INFO L471 AbstractCegarLoop]: Abstraction has 18566 states and 23793 transitions. [2024-11-19 22:22:48,958 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-19 22:22:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 23793 transitions. [2024-11-19 22:22:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 22:22:48,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:48,966 INFO L215 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-19 22:22:48,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:22:48,966 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:48,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash -836659987, now seen corresponding path program 1 times [2024-11-19 22:22:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958841939] [2024-11-19 22:22:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 22:22:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:22:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-19 22:22:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,048 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-19 22:22:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958841939] [2024-11-19 22:22:49,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958841939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:22:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605101778] [2024-11-19 22:22:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:22:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:49,051 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-19 22:22:49,053 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-19 22:22:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:49,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 22:22:49,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:22:49,186 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-19 22:22:49,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:22:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605101778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:22:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-19 22:22:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834835244] [2024-11-19 22:22:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:49,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:22:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:49,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:22:49,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:22:49,192 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-19 22:22:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:50,785 INFO L93 Difference]: Finished difference Result 29293 states and 38546 transitions. [2024-11-19 22:22:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:22:50,785 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-19 22:22:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:50,874 INFO L225 Difference]: With dead ends: 29293 [2024-11-19 22:22:50,874 INFO L226 Difference]: Without dead ends: 18186 [2024-11-19 22:22:50,912 INFO L431 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-19 22:22:50,914 INFO L432 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-19 22:22:50,915 INFO L433 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-19 22:22:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18186 states. [2024-11-19 22:22:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18186 to 18124. [2024-11-19 22:22:52,721 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-19 22:22:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18124 states to 18124 states and 23056 transitions. [2024-11-19 22:22:52,786 INFO L78 Accepts]: Start accepts. Automaton has 18124 states and 23056 transitions. Word has length 159 [2024-11-19 22:22:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:52,787 INFO L471 AbstractCegarLoop]: Abstraction has 18124 states and 23056 transitions. [2024-11-19 22:22:52,787 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-19 22:22:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 18124 states and 23056 transitions. [2024-11-19 22:22:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 22:22:52,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:52,795 INFO L215 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-19 22:22:52,805 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-19 22:22:52,996 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-19 22:22:52,997 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:52,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1562564278, now seen corresponding path program 1 times [2024-11-19 22:22:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:52,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062604108] [2024-11-19 22:22:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 22:22:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:22:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-19 22:22:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:53,112 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-19 22:22:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062604108] [2024-11-19 22:22:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062604108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:22:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517609217] [2024-11-19 22:22:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:22:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:22:53,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:22:53,115 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-19 22:22:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:54,731 INFO L93 Difference]: Finished difference Result 31318 states and 40022 transitions. [2024-11-19 22:22:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:22:54,732 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-19 22:22:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:54,784 INFO L225 Difference]: With dead ends: 31318 [2024-11-19 22:22:54,784 INFO L226 Difference]: Without dead ends: 14908 [2024-11-19 22:22:54,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:22:54,815 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 575 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-19 22:22:54,815 INFO L433 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-19 22:22:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14908 states. [2024-11-19 22:22:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14908 to 13406. [2024-11-19 22:22:55,633 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-19 22:22:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13406 states to 13406 states and 16494 transitions. [2024-11-19 22:22:55,664 INFO L78 Accepts]: Start accepts. Automaton has 13406 states and 16494 transitions. Word has length 160 [2024-11-19 22:22:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:55,665 INFO L471 AbstractCegarLoop]: Abstraction has 13406 states and 16494 transitions. [2024-11-19 22:22:55,665 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-19 22:22:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 13406 states and 16494 transitions. [2024-11-19 22:22:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-19 22:22:55,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:55,669 INFO L215 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-19 22:22:55,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:22:55,669 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:55,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1560316271, now seen corresponding path program 1 times [2024-11-19 22:22:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443757059] [2024-11-19 22:22:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 22:22:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:22:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-19 22:22:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,776 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-19 22:22:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443757059] [2024-11-19 22:22:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443757059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:22:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979679343] [2024-11-19 22:22:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:22:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:22:55,779 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-19 22:22:55,780 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-19 22:22:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:55,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 22:22:55,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:22:55,925 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-19 22:22:55,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:22:55,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979679343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:55,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:22:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-19 22:22:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690702783] [2024-11-19 22:22:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:55,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:22:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:22:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:22:55,927 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-19 22:22:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:56,656 INFO L93 Difference]: Finished difference Result 23848 states and 29765 transitions. [2024-11-19 22:22:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:22:56,656 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-19 22:22:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:56,704 INFO L225 Difference]: With dead ends: 23848 [2024-11-19 22:22:56,705 INFO L226 Difference]: Without dead ends: 13447 [2024-11-19 22:22:56,720 INFO L431 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-19 22:22:56,721 INFO L432 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-19 22:22:56,721 INFO L433 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-19 22:22:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13447 states. [2024-11-19 22:22:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13447 to 13394. [2024-11-19 22:22:57,559 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-19 22:22:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13394 states to 13394 states and 16232 transitions. [2024-11-19 22:22:57,594 INFO L78 Accepts]: Start accepts. Automaton has 13394 states and 16232 transitions. Word has length 161 [2024-11-19 22:22:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:22:57,595 INFO L471 AbstractCegarLoop]: Abstraction has 13394 states and 16232 transitions. [2024-11-19 22:22:57,595 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-19 22:22:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13394 states and 16232 transitions. [2024-11-19 22:22:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-19 22:22:57,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:22:57,600 INFO L215 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-19 22:22:57,608 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-19 22:22:57,800 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-19 22:22:57,801 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:22:57,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:22:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1877011828, now seen corresponding path program 2 times [2024-11-19 22:22:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:22:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716398338] [2024-11-19 22:22:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:22:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:22:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:22:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:22:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:22:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:22:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 22:22:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 22:22:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:22:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-19 22:22:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 22:22:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:22:57,961 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-19 22:22:57,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:22:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716398338] [2024-11-19 22:22:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716398338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:22:57,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:22:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:22:57,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937992573] [2024-11-19 22:22:57,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:22:57,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:22:57,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:22:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:22:57,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:22:57,964 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-19 22:22:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:22:59,808 INFO L93 Difference]: Finished difference Result 33256 states and 41784 transitions. [2024-11-19 22:22:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 22:22:59,809 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-19 22:22:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:22:59,879 INFO L225 Difference]: With dead ends: 33256 [2024-11-19 22:22:59,879 INFO L226 Difference]: Without dead ends: 19874 [2024-11-19 22:22:59,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2024-11-19 22:22:59,916 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 966 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:22:59,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 446 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:22:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19874 states. [2024-11-19 22:23:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19874 to 18621. [2024-11-19 22:23:01,220 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-19 22:23:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 21803 transitions. [2024-11-19 22:23:01,257 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 21803 transitions. Word has length 161 [2024-11-19 22:23:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:23:01,258 INFO L471 AbstractCegarLoop]: Abstraction has 18621 states and 21803 transitions. [2024-11-19 22:23:01,258 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-19 22:23:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 21803 transitions. [2024-11-19 22:23:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-19 22:23:01,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:23:01,262 INFO L215 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-19 22:23:01,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:23:01,262 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:23:01,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:23:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1133842763, now seen corresponding path program 1 times [2024-11-19 22:23:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:23:01,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688764879] [2024-11-19 22:23:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:23:01,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:23:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:23:01,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:23:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:23:01,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:23:01,320 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:23:01,321 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:23:01,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 22:23:01,326 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:23:01,450 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:23:01,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:23:01 BoogieIcfgContainer [2024-11-19 22:23:01,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:23:01,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:23:01,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:23:01,454 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:23:01,454 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:19" (3/4) ... [2024-11-19 22:23:01,455 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:23:01,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:23:01,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:23:01,567 INFO L158 Benchmark]: Toolchain (without parser) took 42983.97ms. Allocated memory was 178.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 120.4MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-19 22:23:01,567 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:23:01,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.88ms. Allocated memory is still 178.3MB. Free memory was 120.4MB in the beginning and 104.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:23:01,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 178.3MB. Free memory was 104.7MB in the beginning and 102.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:23:01,568 INFO L158 Benchmark]: Boogie Preprocessor took 62.63ms. Allocated memory is still 178.3MB. Free memory was 102.3MB in the beginning and 100.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:23:01,568 INFO L158 Benchmark]: RCFGBuilder took 554.77ms. Allocated memory is still 178.3MB. Free memory was 100.0MB in the beginning and 78.1MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 22:23:01,569 INFO L158 Benchmark]: TraceAbstraction took 41815.72ms. Allocated memory was 178.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 77.2MB in the beginning and 4.5GB in the end (delta: -4.5GB). Peak memory consumption was 952.4MB. Max. memory is 16.1GB. [2024-11-19 22:23:01,569 INFO L158 Benchmark]: Witness Printer took 112.64ms. Allocated memory is still 5.6GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:23:01,572 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.22ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.88ms. Allocated memory is still 178.3MB. Free memory was 120.4MB in the beginning and 104.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 178.3MB. Free memory was 104.7MB in the beginning and 102.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.63ms. Allocated memory is still 178.3MB. Free memory was 102.3MB in the beginning and 100.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.77ms. Allocated memory is still 178.3MB. Free memory was 100.0MB in the beginning and 78.1MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 41815.72ms. Allocated memory was 178.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 77.2MB in the beginning and 4.5GB in the end (delta: -4.5GB). Peak memory consumption was 952.4MB. Max. memory is 16.1GB. * Witness Printer took 112.64ms. Allocated memory is still 5.6GB. Free memory was 4.5GB in the beginning and 4.5GB 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: 41.6s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9047 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8848 mSDsluCounter, 11579 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7406 mSDsCounter, 1187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9464 IncrementalHoareTripleChecker+Invalid, 10651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1187 mSolverCounterUnsat, 4173 mSDtfsCounter, 9464 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.6s 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: 12.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 9858 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s 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-19 22:23:01,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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