./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label07.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 310a228ac9ef963df74602c7a325253060c00e1ba8762b129fbb4c87e9827f78 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:34:36,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:34:36,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:34:36,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:34:36,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:34:36,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:34:36,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:34:36,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:34:36,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:34:36,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:34:36,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:34:36,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:34:36,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:34:36,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:34:36,818 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:34:36,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:34:36,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:34:36,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:34:36,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:34:36,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:34:36,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:34:36,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:34:36,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:34:36,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:34:36,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:34:36,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:34:36,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:34:36,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:34:36,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:34:36,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:34:36,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:34:36,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:34:36,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:36,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:34:36,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:34:36,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:34:36,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:34:36,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:34:36,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:34:36,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:34:36,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:34:36,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:34:36,828 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-clean/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-clean/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 -> 310a228ac9ef963df74602c7a325253060c00e1ba8762b129fbb4c87e9827f78 [2024-10-10 22:34:37,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:34:37,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:34:37,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:34:37,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:34:37,138 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:34:37,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label07.c [2024-10-10 22:34:38,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:34:38,865 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:34:38,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label07.c [2024-10-10 22:34:38,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3b1505a24/b4628b0f3f614d3bbc603cd01cdc95be/FLAGedd9e61a9 [2024-10-10 22:34:38,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3b1505a24/b4628b0f3f614d3bbc603cd01cdc95be [2024-10-10 22:34:38,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:34:38,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:34:38,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:38,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:34:38,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:34:38,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:38" (1/1) ... [2024-10-10 22:34:38,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423eb85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:38, skipping insertion in model container [2024-10-10 22:34:38,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:38" (1/1) ... [2024-10-10 22:34:38,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:34:39,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label07.c[21220,21233] [2024-10-10 22:34:39,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:39,364 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:34:39,438 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label07.c[21220,21233] [2024-10-10 22:34:39,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:39,465 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:34:39,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39 WrapperNode [2024-10-10 22:34:39,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:39,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:39,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:34:39,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:34:39,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,553 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-10 22:34:39,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:39,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:34:39,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:34:39,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:34:39,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,599 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:34:39,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:34:39,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:34:39,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:34:39,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:34:39,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (1/1) ... [2024-10-10 22:34:39,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:39,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:39,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:34:39,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:34:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:34:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:34:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:34:39,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:34:39,873 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:34:39,876 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:34:40,869 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 22:34:40,870 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:34:40,931 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:34:40,932 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:34:40,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:40 BoogieIcfgContainer [2024-10-10 22:34:40,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:34:40,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:34:40,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:34:40,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:34:40,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:34:38" (1/3) ... [2024-10-10 22:34:40,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729faa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:40, skipping insertion in model container [2024-10-10 22:34:40,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:39" (2/3) ... [2024-10-10 22:34:40,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729faa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:40, skipping insertion in model container [2024-10-10 22:34:40,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:40" (3/3) ... [2024-10-10 22:34:40,944 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label07.c [2024-10-10 22:34:40,962 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:34:40,962 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:34:41,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:34:41,037 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;@6d5e86a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:34:41,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:34:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-10 22:34:41,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:41,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:41,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:41,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 711698917, now seen corresponding path program 1 times [2024-10-10 22:34:41,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:41,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420986999] [2024-10-10 22:34:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:41,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:41,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420986999] [2024-10-10 22:34:41,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420986999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:41,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:41,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:41,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82699084] [2024-10-10 22:34:41,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:41,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:34:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:34:41,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:34:41,536 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:41,571 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-10 22:34:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:34:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-10-10 22:34:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:41,583 INFO L225 Difference]: With dead ends: 329 [2024-10-10 22:34:41,583 INFO L226 Difference]: Without dead ends: 163 [2024-10-10 22:34:41,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:34:41,588 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:41,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:34:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-10 22:34:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-10 22:34:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-10 22:34:41,626 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 138 [2024-10-10 22:34:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-10 22:34:41,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-10 22:34:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-10 22:34:41,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:41,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:41,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:34:41,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:41,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash 111007034, now seen corresponding path program 1 times [2024-10-10 22:34:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:41,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588889077] [2024-10-10 22:34:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:42,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588889077] [2024-10-10 22:34:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588889077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:42,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:42,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:42,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887367132] [2024-10-10 22:34:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:42,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:42,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:42,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:42,101 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:42,726 INFO L93 Difference]: Finished difference Result 466 states and 712 transitions. [2024-10-10 22:34:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-10-10 22:34:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:42,733 INFO L225 Difference]: With dead ends: 466 [2024-10-10 22:34:42,734 INFO L226 Difference]: Without dead ends: 304 [2024-10-10 22:34:42,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:42,737 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 81 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:42,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 42 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:34:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-10 22:34:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-10 22:34:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2024-10-10 22:34:42,759 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 138 [2024-10-10 22:34:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2024-10-10 22:34:42,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2024-10-10 22:34:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-10 22:34:42,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:42,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:34:42,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:42,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:42,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1883677104, now seen corresponding path program 1 times [2024-10-10 22:34:42,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:42,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131005665] [2024-10-10 22:34:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:42,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:42,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131005665] [2024-10-10 22:34:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131005665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:42,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104932599] [2024-10-10 22:34:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:42,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:43,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:43,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:43,002 INFO L87 Difference]: Start difference. First operand 304 states and 463 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:43,488 INFO L93 Difference]: Finished difference Result 899 states and 1373 transitions. [2024-10-10 22:34:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:43,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2024-10-10 22:34:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:43,492 INFO L225 Difference]: With dead ends: 899 [2024-10-10 22:34:43,492 INFO L226 Difference]: Without dead ends: 596 [2024-10-10 22:34:43,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:43,494 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:43,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 70 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-10 22:34:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 455. [2024-10-10 22:34:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.4911894273127753) internal successors, (677), 454 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 677 transitions. [2024-10-10 22:34:43,520 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 677 transitions. Word has length 149 [2024-10-10 22:34:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:43,521 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 677 transitions. [2024-10-10 22:34:43,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 677 transitions. [2024-10-10 22:34:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-10 22:34:43,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:43,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:43,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:34:43,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash 323241177, now seen corresponding path program 1 times [2024-10-10 22:34:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467261011] [2024-10-10 22:34:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467261011] [2024-10-10 22:34:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467261011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:43,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:43,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514950211] [2024-10-10 22:34:43,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:43,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:43,673 INFO L87 Difference]: Start difference. First operand 455 states and 677 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:44,090 INFO L93 Difference]: Finished difference Result 1349 states and 2014 transitions. [2024-10-10 22:34:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:44,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-10-10 22:34:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:44,095 INFO L225 Difference]: With dead ends: 1349 [2024-10-10 22:34:44,095 INFO L226 Difference]: Without dead ends: 895 [2024-10-10 22:34:44,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:44,097 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:44,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 122 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-10-10 22:34:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 748. [2024-10-10 22:34:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4404283801874163) internal successors, (1076), 747 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1076 transitions. [2024-10-10 22:34:44,123 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1076 transitions. Word has length 156 [2024-10-10 22:34:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:44,123 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1076 transitions. [2024-10-10 22:34:44,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1076 transitions. [2024-10-10 22:34:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-10 22:34:44,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:44,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:44,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:34:44,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:44,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 550285539, now seen corresponding path program 1 times [2024-10-10 22:34:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002675986] [2024-10-10 22:34:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:44,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002675986] [2024-10-10 22:34:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002675986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:44,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405450401] [2024-10-10 22:34:44,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:44,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:44,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:44,266 INFO L87 Difference]: Start difference. First operand 748 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:44,731 INFO L93 Difference]: Finished difference Result 2198 states and 3170 transitions. [2024-10-10 22:34:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:44,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-10-10 22:34:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:44,738 INFO L225 Difference]: With dead ends: 2198 [2024-10-10 22:34:44,738 INFO L226 Difference]: Without dead ends: 1451 [2024-10-10 22:34:44,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:44,742 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 178 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:44,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 73 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-10-10 22:34:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2024-10-10 22:34:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1450 states have (on average 1.3648275862068966) internal successors, (1979), 1450 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1979 transitions. [2024-10-10 22:34:44,778 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1979 transitions. Word has length 160 [2024-10-10 22:34:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:44,778 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 1979 transitions. [2024-10-10 22:34:44,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1979 transitions. [2024-10-10 22:34:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-10 22:34:44,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:44,784 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:44,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:34:44,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2036174871, now seen corresponding path program 1 times [2024-10-10 22:34:44,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:44,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785524474] [2024-10-10 22:34:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785524474] [2024-10-10 22:34:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785524474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:44,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413198162] [2024-10-10 22:34:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:44,914 INFO L87 Difference]: Start difference. First operand 1451 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:45,386 INFO L93 Difference]: Finished difference Result 4026 states and 5486 transitions. [2024-10-10 22:34:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2024-10-10 22:34:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:45,396 INFO L225 Difference]: With dead ends: 4026 [2024-10-10 22:34:45,397 INFO L226 Difference]: Without dead ends: 2576 [2024-10-10 22:34:45,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:45,400 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 117 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:45,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 127 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2024-10-10 22:34:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2433. [2024-10-10 22:34:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2432 states have (on average 1.246299342105263) internal successors, (3031), 2432 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3031 transitions. [2024-10-10 22:34:45,480 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3031 transitions. Word has length 169 [2024-10-10 22:34:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:45,480 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3031 transitions. [2024-10-10 22:34:45,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3031 transitions. [2024-10-10 22:34:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-10 22:34:45,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:45,489 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:45,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:34:45,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:45,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1746927400, now seen corresponding path program 1 times [2024-10-10 22:34:45,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:45,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524109688] [2024-10-10 22:34:45,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:45,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-10 22:34:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524109688] [2024-10-10 22:34:45,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524109688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:45,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:45,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749829604] [2024-10-10 22:34:45,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:45,687 INFO L87 Difference]: Start difference. First operand 2433 states and 3031 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:46,177 INFO L93 Difference]: Finished difference Result 5848 states and 7350 transitions. [2024-10-10 22:34:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:46,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2024-10-10 22:34:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:46,190 INFO L225 Difference]: With dead ends: 5848 [2024-10-10 22:34:46,190 INFO L226 Difference]: Without dead ends: 3416 [2024-10-10 22:34:46,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:46,195 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 144 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:46,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 248 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2024-10-10 22:34:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3273. [2024-10-10 22:34:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 3272 states have (on average 1.2044621026894866) internal successors, (3941), 3272 states have internal predecessors, (3941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 3941 transitions. [2024-10-10 22:34:46,293 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 3941 transitions. Word has length 191 [2024-10-10 22:34:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:46,293 INFO L471 AbstractCegarLoop]: Abstraction has 3273 states and 3941 transitions. [2024-10-10 22:34:46,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 3941 transitions. [2024-10-10 22:34:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 22:34:46,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:46,300 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:46,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:34:46,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 483377120, now seen corresponding path program 1 times [2024-10-10 22:34:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508591947] [2024-10-10 22:34:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 22:34:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:46,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508591947] [2024-10-10 22:34:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508591947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434324649] [2024-10-10 22:34:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:46,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:46,458 INFO L87 Difference]: Start difference. First operand 3273 states and 3941 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:46,915 INFO L93 Difference]: Finished difference Result 7387 states and 8848 transitions. [2024-10-10 22:34:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-10-10 22:34:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:46,929 INFO L225 Difference]: With dead ends: 7387 [2024-10-10 22:34:46,930 INFO L226 Difference]: Without dead ends: 4115 [2024-10-10 22:34:46,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:46,936 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:46,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 264 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2024-10-10 22:34:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4113. [2024-10-10 22:34:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4113 states, 4112 states have (on average 1.171206225680934) internal successors, (4816), 4112 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 4816 transitions. [2024-10-10 22:34:47,017 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 4816 transitions. Word has length 205 [2024-10-10 22:34:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:47,017 INFO L471 AbstractCegarLoop]: Abstraction has 4113 states and 4816 transitions. [2024-10-10 22:34:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 4816 transitions. [2024-10-10 22:34:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-10 22:34:47,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:47,026 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:47,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:34:47,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:47,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1774692154, now seen corresponding path program 1 times [2024-10-10 22:34:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:47,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561051719] [2024-10-10 22:34:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:47,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-10 22:34:47,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:47,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561051719] [2024-10-10 22:34:47,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561051719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:47,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:47,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848998836] [2024-10-10 22:34:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:47,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:47,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:47,182 INFO L87 Difference]: Start difference. First operand 4113 states and 4816 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:47,623 INFO L93 Difference]: Finished difference Result 8225 states and 9632 transitions. [2024-10-10 22:34:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2024-10-10 22:34:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:47,627 INFO L225 Difference]: With dead ends: 8225 [2024-10-10 22:34:47,628 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:34:47,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:47,635 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:47,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 48 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:34:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:34:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:34:47,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2024-10-10 22:34:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:47,637 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:34:47,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:34:47,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:34:47,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:34:47,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:34:47,647 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:47,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:34:47,766 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:34:47,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:34:47 BoogieIcfgContainer [2024-10-10 22:34:47,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:34:47,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:34:47,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:34:47,786 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:34:47,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:40" (3/4) ... [2024-10-10 22:34:47,791 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:34:47,812 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:34:47,813 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:34:47,814 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:34:47,815 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:34:47,975 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:34:47,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:34:47,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:34:47,977 INFO L158 Benchmark]: Toolchain (without parser) took 9068.66ms. Allocated memory was 174.1MB in the beginning and 274.7MB in the end (delta: 100.7MB). Free memory was 145.4MB in the beginning and 102.6MB in the end (delta: 42.8MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2024-10-10 22:34:47,977 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:34:47,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.78ms. Allocated memory is still 174.1MB. Free memory was 145.4MB in the beginning and 116.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:47,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.00ms. Allocated memory is still 174.1MB. Free memory was 116.9MB in the beginning and 111.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:47,978 INFO L158 Benchmark]: Boogie Preprocessor took 84.31ms. Allocated memory is still 174.1MB. Free memory was 111.0MB in the beginning and 105.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:47,978 INFO L158 Benchmark]: RCFGBuilder took 1293.74ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 105.6MB in the beginning and 182.0MB in the end (delta: -76.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-10 22:34:47,979 INFO L158 Benchmark]: TraceAbstraction took 6849.26ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 181.0MB in the beginning and 115.2MB in the end (delta: 65.8MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2024-10-10 22:34:47,979 INFO L158 Benchmark]: Witness Printer took 190.62ms. Allocated memory is still 274.7MB. Free memory was 114.2MB in the beginning and 102.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 22:34:47,980 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.16ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.78ms. Allocated memory is still 174.1MB. Free memory was 145.4MB in the beginning and 116.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.00ms. Allocated memory is still 174.1MB. Free memory was 116.9MB in the beginning and 111.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.31ms. Allocated memory is still 174.1MB. Free memory was 111.0MB in the beginning and 105.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1293.74ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 105.6MB in the beginning and 182.0MB in the end (delta: -76.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6849.26ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 181.0MB in the beginning and 115.2MB in the end (delta: 65.8MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. * Witness Printer took 190.62ms. Allocated memory is still 274.7MB. Free memory was 114.2MB in the beginning and 102.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1142 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1142 mSDsluCounter, 1242 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2973 IncrementalHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 1116 mSDtfsCounter, 2973 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4113occurred in iteration=8, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 576 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1516 NumberOfCodeBlocks, 1516 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1507 ConstructedInterpolants, 0 QuantifiedInterpolants, 2075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 410/410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((a11 == 0) && (a19 == 1)) || ((a25 != 1) && (a19 == 1))) || ((a11 == 0) && (a25 == 0))) || (a28 < 11)) || ((8 <= a17) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:34:48,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE