./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/Problem14_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc39b25e5d6bf00ba7a149cc452827f6c69f8a46e091e8e5858372a0b5fafb1a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:42:36,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:42:36,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:42:36,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:42:36,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:42:36,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:42:36,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:42:36,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:42:36,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:42:36,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:42:36,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:42:36,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:42:36,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:42:36,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:42:36,819 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:42:36,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:42:36,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:42:36,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:42:36,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:42:36,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:42:36,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:42:36,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:42:36,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:42:36,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:42:36,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:42:36,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:42:36,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:42:36,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:42:36,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:42:36,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:42:36,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:42:36,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:42:36,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:42:36,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:42:36,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:42:36,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:42:36,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:42:36,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:42:36,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:42:36,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:42:36,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:42:36,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:42:36,830 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc39b25e5d6bf00ba7a149cc452827f6c69f8a46e091e8e5858372a0b5fafb1a [2024-10-13 23:42:37,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:42:37,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:42:37,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:42:37,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:42:37,136 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:42:37,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2024-10-13 23:42:38,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:42:38,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:42:38,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2024-10-13 23:42:38,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9e3133e/d33a9b33f60f471db91555bc6cdb8b57/FLAGfd2b948cf [2024-10-13 23:42:38,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9e3133e/d33a9b33f60f471db91555bc6cdb8b57 [2024-10-13 23:42:38,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:42:38,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:42:38,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:42:38,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:42:38,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:42:38,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:42:38" (1/1) ... [2024-10-13 23:42:38,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdbaaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:38, skipping insertion in model container [2024-10-13 23:42:38,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:42:38" (1/1) ... [2024-10-13 23:42:38,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:42:39,182 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/Problem14_label20.c[6130,6143] [2024-10-13 23:42:39,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:42:39,416 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:42:39,440 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/Problem14_label20.c[6130,6143] [2024-10-13 23:42:39,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:42:39,521 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:42:39,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39 WrapperNode [2024-10-13 23:42:39,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:42:39,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:42:39,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:42:39,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:42:39,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,614 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-13 23:42:39,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:42:39,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:42:39,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:42:39,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:42:39,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,684 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-13 23:42:39,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:42:39,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:42:39,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:42:39,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:42:39,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (1/1) ... [2024-10-13 23:42:39,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:42:39,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:39,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:42:39,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:42:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:42:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:42:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:42:39,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:42:39,909 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:42:39,911 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:42:41,099 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 23:42:41,099 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:42:41,155 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:42:41,156 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:42:41,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:41 BoogieIcfgContainer [2024-10-13 23:42:41,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:42:41,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:42:41,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:42:41,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:42:41,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:42:38" (1/3) ... [2024-10-13 23:42:41,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0a46b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:42:41, skipping insertion in model container [2024-10-13 23:42:41,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:39" (2/3) ... [2024-10-13 23:42:41,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0a46b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:42:41, skipping insertion in model container [2024-10-13 23:42:41,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:41" (3/3) ... [2024-10-13 23:42:41,167 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label20.c [2024-10-13 23:42:41,180 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:42:41,180 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:42:41,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:42:41,248 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;@540fbda7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:42:41,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:42:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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-13 23:42:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 23:42:41,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:41,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:41,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:41,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 639268767, now seen corresponding path program 1 times [2024-10-13 23:42:41,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:41,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712780620] [2024-10-13 23:42:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:41,494 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-13 23:42:41,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:41,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712780620] [2024-10-13 23:42:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712780620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:41,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:41,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803055270] [2024-10-13 23:42:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:41,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:42:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:41,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:42:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:42:41,530 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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-13 23:42:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:41,589 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-13 23:42:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:42:41,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2024-10-13 23:42:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:41,602 INFO L225 Difference]: With dead ends: 365 [2024-10-13 23:42:41,602 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 23:42:41,606 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-13 23:42:41,612 INFO L432 NwaCegarLoop]: 295 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, 295 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-13 23:42:41,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:42:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 23:42:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-13 23:42:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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-13 23:42:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-13 23:42:41,668 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 59 [2024-10-13 23:42:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:41,668 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-13 23:42:41,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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-13 23:42:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-13 23:42:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 23:42:41,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:41,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:41,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:42:41,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:41,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1710710538, now seen corresponding path program 1 times [2024-10-13 23:42:41,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:41,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577666182] [2024-10-13 23:42:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:41,931 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-13 23:42:41,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:41,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577666182] [2024-10-13 23:42:41,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577666182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:41,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:41,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:41,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76725439] [2024-10-13 23:42:41,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:41,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:41,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:41,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:41,936 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-13 23:42:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:42,656 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2024-10-13 23:42:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2024-10-13 23:42:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:42,659 INFO L225 Difference]: With dead ends: 361 [2024-10-13 23:42:42,662 INFO L226 Difference]: Without dead ends: 359 [2024-10-13 23:42:42,663 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-13 23:42:42,664 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:42,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 10 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:42:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-13 23:42:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-13 23:42:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6396648044692737) internal successors, (587), 358 states have internal predecessors, (587), 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-13 23:42:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 587 transitions. [2024-10-13 23:42:42,692 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 587 transitions. Word has length 59 [2024-10-13 23:42:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:42,693 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 587 transitions. [2024-10-13 23:42:42,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-13 23:42:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 587 transitions. [2024-10-13 23:42:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 23:42:42,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:42,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:42:42,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:42:42,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:42,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1538737276, now seen corresponding path program 1 times [2024-10-13 23:42:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660172884] [2024-10-13 23:42:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:42,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660172884] [2024-10-13 23:42:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660172884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:42,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256472083] [2024-10-13 23:42:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:42,901 INFO L87 Difference]: Start difference. First operand 359 states and 587 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-13 23:42:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:43,557 INFO L93 Difference]: Finished difference Result 1075 states and 1759 transitions. [2024-10-13 23:42:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:43,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-10-13 23:42:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:43,561 INFO L225 Difference]: With dead ends: 1075 [2024-10-13 23:42:43,562 INFO L226 Difference]: Without dead ends: 717 [2024-10-13 23:42:43,563 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-13 23:42:43,564 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:43,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 86 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-13 23:42:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2024-10-13 23:42:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.42296918767507) internal successors, (1016), 714 states have internal predecessors, (1016), 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-13 23:42:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1016 transitions. [2024-10-13 23:42:43,605 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1016 transitions. Word has length 124 [2024-10-13 23:42:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:43,606 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1016 transitions. [2024-10-13 23:42:43,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-13 23:42:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1016 transitions. [2024-10-13 23:42:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 23:42:43,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:43,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:42:43,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:42:43,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:43,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1737668795, now seen corresponding path program 1 times [2024-10-13 23:42:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470148777] [2024-10-13 23:42:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:43,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470148777] [2024-10-13 23:42:43,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470148777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:43,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:43,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:43,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569601336] [2024-10-13 23:42:43,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:43,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:43,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:43,766 INFO L87 Difference]: Start difference. First operand 715 states and 1016 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-13 23:42:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:44,382 INFO L93 Difference]: Finished difference Result 1607 states and 2323 transitions. [2024-10-13 23:42:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 125 [2024-10-13 23:42:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:44,387 INFO L225 Difference]: With dead ends: 1607 [2024-10-13 23:42:44,387 INFO L226 Difference]: Without dead ends: 893 [2024-10-13 23:42:44,389 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-13 23:42:44,390 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:44,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 55 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-10-13 23:42:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2024-10-13 23:42:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3318385650224216) internal successors, (1188), 892 states have internal predecessors, (1188), 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-13 23:42:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1188 transitions. [2024-10-13 23:42:44,411 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1188 transitions. Word has length 125 [2024-10-13 23:42:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1188 transitions. [2024-10-13 23:42:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-13 23:42:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1188 transitions. [2024-10-13 23:42:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 23:42:44,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:44,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:42:44,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:42:44,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1459061114, now seen corresponding path program 1 times [2024-10-13 23:42:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:44,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179937231] [2024-10-13 23:42:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:44,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:44,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179937231] [2024-10-13 23:42:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179937231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:44,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:44,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312528001] [2024-10-13 23:42:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:44,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:44,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:44,713 INFO L87 Difference]: Start difference. First operand 893 states and 1188 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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-13 23:42:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:45,606 INFO L93 Difference]: Finished difference Result 2143 states and 2781 transitions. [2024-10-13 23:42:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:45,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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 128 [2024-10-13 23:42:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:45,611 INFO L225 Difference]: With dead ends: 2143 [2024-10-13 23:42:45,612 INFO L226 Difference]: Without dead ends: 1251 [2024-10-13 23:42:45,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:45,614 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 440 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:45,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 121 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:42:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-10-13 23:42:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2024-10-13 23:42:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2572115384615385) internal successors, (1569), 1248 states have internal predecessors, (1569), 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-13 23:42:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1569 transitions. [2024-10-13 23:42:45,639 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1569 transitions. Word has length 128 [2024-10-13 23:42:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:45,640 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1569 transitions. [2024-10-13 23:42:45,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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-13 23:42:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1569 transitions. [2024-10-13 23:42:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 23:42:45,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:45,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:42:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:42:45,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1370518530, now seen corresponding path program 1 times [2024-10-13 23:42:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279436431] [2024-10-13 23:42:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:45,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279436431] [2024-10-13 23:42:45,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279436431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:45,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:45,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852171923] [2024-10-13 23:42:45,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:45,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:45,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:45,827 INFO L87 Difference]: Start difference. First operand 1249 states and 1569 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-13 23:42:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:46,584 INFO L93 Difference]: Finished difference Result 2884 states and 3572 transitions. [2024-10-13 23:42:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2024-10-13 23:42:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:46,592 INFO L225 Difference]: With dead ends: 2884 [2024-10-13 23:42:46,592 INFO L226 Difference]: Without dead ends: 1607 [2024-10-13 23:42:46,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:46,595 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 103 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:46,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 120 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:42:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-10-13 23:42:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2024-10-13 23:42:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1315461346633418) internal successors, (1815), 1604 states have internal predecessors, (1815), 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-13 23:42:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1815 transitions. [2024-10-13 23:42:46,633 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1815 transitions. Word has length 139 [2024-10-13 23:42:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:46,633 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1815 transitions. [2024-10-13 23:42:46,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-13 23:42:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1815 transitions. [2024-10-13 23:42:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 23:42:46,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:46,636 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:42:46,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:42:46,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:46,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:46,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1882912144, now seen corresponding path program 1 times [2024-10-13 23:42:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:46,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424413321] [2024-10-13 23:42:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:46,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:46,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424413321] [2024-10-13 23:42:46,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424413321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:46,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:46,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:46,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233290941] [2024-10-13 23:42:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:46,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:46,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:46,941 INFO L87 Difference]: Start difference. First operand 1605 states and 1815 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-13 23:42:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:47,431 INFO L93 Difference]: Finished difference Result 3921 states and 4493 transitions. [2024-10-13 23:42:47,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:47,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 233 [2024-10-13 23:42:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:47,439 INFO L225 Difference]: With dead ends: 3921 [2024-10-13 23:42:47,439 INFO L226 Difference]: Without dead ends: 2317 [2024-10-13 23:42:47,441 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-13 23:42:47,442 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:47,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 74 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-10-13 23:42:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2317. [2024-10-13 23:42:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.113126079447323) internal successors, (2578), 2316 states have internal predecessors, (2578), 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-13 23:42:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2578 transitions. [2024-10-13 23:42:47,479 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2578 transitions. Word has length 233 [2024-10-13 23:42:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2578 transitions. [2024-10-13 23:42:47,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-13 23:42:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2578 transitions. [2024-10-13 23:42:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-13 23:42:47,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:47,484 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:47,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:42:47,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:47,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1644552159, now seen corresponding path program 1 times [2024-10-13 23:42:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193606368] [2024-10-13 23:42:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:47,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-13 23:42:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193606368] [2024-10-13 23:42:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193606368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:47,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902209496] [2024-10-13 23:42:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:47,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:47,886 INFO L87 Difference]: Start difference. First operand 2317 states and 2578 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 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-13 23:42:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:48,532 INFO L93 Difference]: Finished difference Result 4691 states and 5237 transitions. [2024-10-13 23:42:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:48,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 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 350 [2024-10-13 23:42:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:48,541 INFO L225 Difference]: With dead ends: 4691 [2024-10-13 23:42:48,542 INFO L226 Difference]: Without dead ends: 2495 [2024-10-13 23:42:48,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:48,545 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:48,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-10-13 23:42:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2317. [2024-10-13 23:42:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.0738341968911918) internal successors, (2487), 2316 states have internal predecessors, (2487), 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-13 23:42:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2487 transitions. [2024-10-13 23:42:48,587 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2487 transitions. Word has length 350 [2024-10-13 23:42:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:48,588 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2487 transitions. [2024-10-13 23:42:48,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 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-13 23:42:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2487 transitions. [2024-10-13 23:42:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2024-10-13 23:42:48,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:48,597 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 23:42:48,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:42:48,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1489699856, now seen corresponding path program 1 times [2024-10-13 23:42:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611000124] [2024-10-13 23:42:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611000124] [2024-10-13 23:42:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611000124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:49,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:49,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87383838] [2024-10-13 23:42:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:49,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:49,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:49,142 INFO L87 Difference]: Start difference. First operand 2317 states and 2487 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-13 23:42:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:49,670 INFO L93 Difference]: Finished difference Result 4811 states and 5231 transitions. [2024-10-13 23:42:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 445 [2024-10-13 23:42:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:49,681 INFO L225 Difference]: With dead ends: 4811 [2024-10-13 23:42:49,681 INFO L226 Difference]: Without dead ends: 2673 [2024-10-13 23:42:49,684 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-13 23:42:49,686 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:49,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-13 23:42:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2139. [2024-10-13 23:42:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.0734331150608045) internal successors, (2295), 2138 states have internal predecessors, (2295), 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-13 23:42:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2295 transitions. [2024-10-13 23:42:49,725 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2295 transitions. Word has length 445 [2024-10-13 23:42:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:49,726 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2295 transitions. [2024-10-13 23:42:49,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-13 23:42:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2295 transitions. [2024-10-13 23:42:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-10-13 23:42:49,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:49,732 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:49,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:42:49,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:49,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1465601533, now seen corresponding path program 1 times [2024-10-13 23:42:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728310210] [2024-10-13 23:42:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:50,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728310210] [2024-10-13 23:42:50,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728310210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:50,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:50,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:50,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733885480] [2024-10-13 23:42:50,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:50,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:50,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:50,120 INFO L87 Difference]: Start difference. First operand 2139 states and 2295 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-13 23:42:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:50,631 INFO L93 Difference]: Finished difference Result 4811 states and 5233 transitions. [2024-10-13 23:42:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:50,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 452 [2024-10-13 23:42:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:50,641 INFO L225 Difference]: With dead ends: 4811 [2024-10-13 23:42:50,641 INFO L226 Difference]: Without dead ends: 2851 [2024-10-13 23:42:50,644 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-13 23:42:50,645 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:50,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 200 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-13 23:42:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2495. [2024-10-13 23:42:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.0842020850040097) internal successors, (2704), 2494 states have internal predecessors, (2704), 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-13 23:42:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 2704 transitions. [2024-10-13 23:42:50,690 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 2704 transitions. Word has length 452 [2024-10-13 23:42:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:50,691 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 2704 transitions. [2024-10-13 23:42:50,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-13 23:42:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2704 transitions. [2024-10-13 23:42:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-10-13 23:42:50,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:50,700 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:50,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:42:50,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1398934318, now seen corresponding path program 1 times [2024-10-13 23:42:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520878336] [2024-10-13 23:42:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520878336] [2024-10-13 23:42:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520878336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:51,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206171828] [2024-10-13 23:42:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:51,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:51,023 INFO L87 Difference]: Start difference. First operand 2495 states and 2704 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-13 23:42:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:51,541 INFO L93 Difference]: Finished difference Result 5879 states and 6461 transitions. [2024-10-13 23:42:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 493 [2024-10-13 23:42:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:51,554 INFO L225 Difference]: With dead ends: 5879 [2024-10-13 23:42:51,554 INFO L226 Difference]: Without dead ends: 3563 [2024-10-13 23:42:51,557 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-13 23:42:51,558 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:51,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 48 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2024-10-13 23:42:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3563. [2024-10-13 23:42:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.080011229646266) internal successors, (3847), 3562 states have internal predecessors, (3847), 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-13 23:42:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3847 transitions. [2024-10-13 23:42:51,630 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3847 transitions. Word has length 493 [2024-10-13 23:42:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:51,631 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3847 transitions. [2024-10-13 23:42:51,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-13 23:42:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3847 transitions. [2024-10-13 23:42:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-10-13 23:42:51,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:51,635 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:51,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:42:51,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:51,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash -722884319, now seen corresponding path program 1 times [2024-10-13 23:42:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:51,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486617896] [2024-10-13 23:42:51,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:51,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-10-13 23:42:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486617896] [2024-10-13 23:42:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486617896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821386748] [2024-10-13 23:42:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:52,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:52,126 INFO L87 Difference]: Start difference. First operand 3563 states and 3847 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-13 23:42:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:52,636 INFO L93 Difference]: Finished difference Result 7125 states and 7709 transitions. [2024-10-13 23:42:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 529 [2024-10-13 23:42:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:52,647 INFO L225 Difference]: With dead ends: 7125 [2024-10-13 23:42:52,647 INFO L226 Difference]: Without dead ends: 3741 [2024-10-13 23:42:52,651 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-13 23:42:52,652 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:52,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 240 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-13 23:42:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3207. [2024-10-13 23:42:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0761072988147224) internal successors, (3450), 3206 states have internal predecessors, (3450), 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-13 23:42:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3450 transitions. [2024-10-13 23:42:52,700 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3450 transitions. Word has length 529 [2024-10-13 23:42:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:52,700 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3450 transitions. [2024-10-13 23:42:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-13 23:42:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3450 transitions. [2024-10-13 23:42:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2024-10-13 23:42:52,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:52,706 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:52,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:42:52,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:52,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 354965901, now seen corresponding path program 1 times [2024-10-13 23:42:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:52,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427044888] [2024-10-13 23:42:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 932 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427044888] [2024-10-13 23:42:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427044888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:53,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338059827] [2024-10-13 23:42:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:53,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:53,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:53,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:42:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:53,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:53,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-13 23:42:53,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338059827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:53,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:53,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:42:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501058955] [2024-10-13 23:42:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:53,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:53,576 INFO L87 Difference]: Start difference. First operand 3207 states and 3450 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-13 23:42:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:54,034 INFO L93 Difference]: Finished difference Result 7125 states and 7712 transitions. [2024-10-13 23:42:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:54,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 648 [2024-10-13 23:42:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:54,047 INFO L225 Difference]: With dead ends: 7125 [2024-10-13 23:42:54,048 INFO L226 Difference]: Without dead ends: 4097 [2024-10-13 23:42:54,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:54,051 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 121 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:54,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 234 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2024-10-13 23:42:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4097. [2024-10-13 23:42:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.0693359375) internal successors, (4380), 4096 states have internal predecessors, (4380), 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-13 23:42:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4380 transitions. [2024-10-13 23:42:54,104 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4380 transitions. Word has length 648 [2024-10-13 23:42:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:54,105 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4380 transitions. [2024-10-13 23:42:54,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-13 23:42:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4380 transitions. [2024-10-13 23:42:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2024-10-13 23:42:54,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:54,113 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:42:54,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:42:54,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 23:42:54,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:54,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash 844619810, now seen corresponding path program 1 times [2024-10-13 23:42:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059791121] [2024-10-13 23:42:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1344 proven. 155 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-13 23:42:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:54,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059791121] [2024-10-13 23:42:54,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059791121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:54,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606816038] [2024-10-13 23:42:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:54,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:54,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:54,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:54,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:42:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:55,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:55,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-10-13 23:42:55,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606816038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:55,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:42:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087931554] [2024-10-13 23:42:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:55,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:55,261 INFO L87 Difference]: Start difference. First operand 4097 states and 4380 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-13 23:42:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:55,731 INFO L93 Difference]: Finished difference Result 4811 states and 5137 transitions. [2024-10-13 23:42:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:55,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 795 [2024-10-13 23:42:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:55,747 INFO L225 Difference]: With dead ends: 4811 [2024-10-13 23:42:55,747 INFO L226 Difference]: Without dead ends: 4809 [2024-10-13 23:42:55,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:55,750 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:55,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 19 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-10-13 23:42:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4097. [2024-10-13 23:42:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.069091796875) internal successors, (4379), 4096 states have internal predecessors, (4379), 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-13 23:42:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4379 transitions. [2024-10-13 23:42:55,816 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4379 transitions. Word has length 795 [2024-10-13 23:42:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:55,817 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4379 transitions. [2024-10-13 23:42:55,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-13 23:42:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4379 transitions. [2024-10-13 23:42:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2024-10-13 23:42:55,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:55,825 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:42:55,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:42:56,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 23:42:56,030 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1714904243, now seen corresponding path program 1 times [2024-10-13 23:42:56,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440527569] [2024-10-13 23:42:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 1374 proven. 155 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-13 23:42:56,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:56,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440527569] [2024-10-13 23:42:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440527569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:56,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221439938] [2024-10-13 23:42:56,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:56,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:56,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:56,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:56,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:42:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:56,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:56,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2024-10-13 23:42:56,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221439938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:56,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:56,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:42:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089131925] [2024-10-13 23:42:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:56,931 INFO L87 Difference]: Start difference. First operand 4097 states and 4379 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-13 23:42:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:57,356 INFO L93 Difference]: Finished difference Result 8903 states and 9616 transitions. [2024-10-13 23:42:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 801 [2024-10-13 23:42:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:57,358 INFO L225 Difference]: With dead ends: 8903 [2024-10-13 23:42:57,358 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:42:57,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:57,366 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 121 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:57,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 236 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:42:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:42:57,367 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-13 23:42:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:42:57,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 801 [2024-10-13 23:42:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:57,368 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:42:57,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-13 23:42:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:42:57,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:42:57,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:42:57,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 23:42:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:57,578 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:57,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:42:57,953 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:42:57,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:42:57 BoogieIcfgContainer [2024-10-13 23:42:57,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:42:57,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:42:57,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:42:57,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:42:57,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:41" (3/4) ... [2024-10-13 23:42:57,979 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:42:58,000 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:42:58,002 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:42:58,003 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:42:58,003 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:42:58,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:42:58,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:42:58,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:42:58,175 INFO L158 Benchmark]: Toolchain (without parser) took 19275.82ms. Allocated memory was 178.3MB in the beginning and 499.1MB in the end (delta: 320.9MB). Free memory was 122.2MB in the beginning and 347.3MB in the end (delta: -225.1MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,176 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 89.0MB in the end (delta: 135.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.72ms. Allocated memory is still 178.3MB. Free memory was 121.7MB in the beginning and 133.3MB in the end (delta: -11.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.48ms. Allocated memory is still 178.3MB. Free memory was 133.3MB in the beginning and 123.6MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,177 INFO L158 Benchmark]: Boogie Preprocessor took 155.87ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 110.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,177 INFO L158 Benchmark]: RCFGBuilder took 1385.53ms. Allocated memory was 178.3MB in the beginning and 234.9MB in the end (delta: 56.6MB). Free memory was 110.9MB in the beginning and 187.4MB in the end (delta: -76.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,177 INFO L158 Benchmark]: TraceAbstraction took 16816.03ms. Allocated memory was 234.9MB in the beginning and 499.1MB in the end (delta: 264.2MB). Free memory was 186.4MB in the beginning and 361.9MB in the end (delta: -175.6MB). Peak memory consumption was 290.1MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,178 INFO L158 Benchmark]: Witness Printer took 198.04ms. Allocated memory is still 499.1MB. Free memory was 361.9MB in the beginning and 347.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 23:42:58,182 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.46ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 89.0MB in the end (delta: 135.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 619.72ms. Allocated memory is still 178.3MB. Free memory was 121.7MB in the beginning and 133.3MB in the end (delta: -11.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.48ms. Allocated memory is still 178.3MB. Free memory was 133.3MB in the beginning and 123.6MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 155.87ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 110.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1385.53ms. Allocated memory was 178.3MB in the beginning and 234.9MB in the end (delta: 56.6MB). Free memory was 110.9MB in the beginning and 187.4MB in the end (delta: -76.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16816.03ms. Allocated memory was 234.9MB in the beginning and 499.1MB in the end (delta: 264.2MB). Free memory was 186.4MB in the beginning and 361.9MB in the end (delta: -175.6MB). Peak memory consumption was 290.1MB. Max. memory is 16.1GB. * Witness Printer took 198.04ms. Allocated memory is still 499.1MB. Free memory was 361.9MB in the beginning and 347.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 194]: 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, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1976 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1976 mSDsluCounter, 1994 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7271 IncrementalHoareTripleChecker+Invalid, 8141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 870 mSolverCounterUnsat, 1925 mSDtfsCounter, 7271 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2286 GetRequests, 2262 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4097occurred in iteration=13, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 2320 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 7624 NumberOfCodeBlocks, 7624 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 7606 ConstructedInterpolants, 0 QuantifiedInterpolants, 15644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2764 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 14158/14578 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: 890]: Loop Invariant Derived loop invariant: ((((((7 <= a15) && (a24 == 1)) || ((9 <= a21) && (a24 == 1))) || ((a24 == 1) && (0 <= ((long long) a12 + 42)))) || ((a24 == 1) && (a21 <= 6))) || (((a15 <= 8) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:42:58,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE