./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/Problem13_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/Problem13_label21.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 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:09:28,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:09:28,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:09:28,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:09:28,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:09:28,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:09:28,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:09:28,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:09:28,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:09:28,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:09:28,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:09:28,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:09:28,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:09:28,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:09:28,967 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:09:28,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:09:28,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:09:28,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:09:28,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:09:28,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:09:28,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:09:28,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:09:28,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:09:28,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:09:28,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:09:28,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:09:28,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:09:28,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:09:28,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:09:28,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:09:28,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:09:28,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:09:28,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:09:28,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:09:28,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:09:28,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:09:28,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:09:28,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:09:28,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:09:28,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:09:28,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:09:28,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:09:28,978 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 -> 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b [2024-10-12 16:09:29,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:09:29,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:09:29,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:09:29,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:09:29,220 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:09:29,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2024-10-12 16:09:30,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:09:31,038 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:09:31,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2024-10-12 16:09:31,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fd01a69/1a273afd35034cc8b6b7af51a2ebe283/FLAG3faa9170e [2024-10-12 16:09:31,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fd01a69/1a273afd35034cc8b6b7af51a2ebe283 [2024-10-12 16:09:31,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:09:31,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:09:31,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:09:31,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:09:31,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:09:31,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:09:31" (1/1) ... [2024-10-12 16:09:31,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a56e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:31, skipping insertion in model container [2024-10-12 16:09:31,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:09:31" (1/1) ... [2024-10-12 16:09:31,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:09:31,447 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/Problem13_label21.c[3130,3143] [2024-10-12 16:09:32,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:09:32,168 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:09:32,181 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/Problem13_label21.c[3130,3143] [2024-10-12 16:09:32,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:09:32,575 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:09:32,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32 WrapperNode [2024-10-12 16:09:32,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:09:32,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:09:32,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:09:32,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:09:32,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:32,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,130 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-12 16:09:33,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:09:33,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:09:33,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:09:33,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:09:33,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,435 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-12 16:09:33,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:09:33,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:09:33,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:09:33,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:09:33,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (1/1) ... [2024-10-12 16:09:33,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:09:33,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:09:33,932 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-12 16:09:33,941 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-12 16:09:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:09:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:09:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:09:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:09:34,027 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:09:34,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:09:38,915 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-12 16:09:38,919 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:09:38,968 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:09:38,969 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:09:38,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:09:38 BoogieIcfgContainer [2024-10-12 16:09:38,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:09:38,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:09:38,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:09:38,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:09:38,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:09:31" (1/3) ... [2024-10-12 16:09:38,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c26334f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:09:38, skipping insertion in model container [2024-10-12 16:09:38,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:09:32" (2/3) ... [2024-10-12 16:09:38,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c26334f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:09:38, skipping insertion in model container [2024-10-12 16:09:38,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:09:38" (3/3) ... [2024-10-12 16:09:38,975 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label21.c [2024-10-12 16:09:38,988 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:09:38,988 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:09:39,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:09:39,080 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;@41f60f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:09:39,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:09:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 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-12 16:09:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 16:09:39,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:39,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:39,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:39,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2045375979, now seen corresponding path program 1 times [2024-10-12 16:09:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385347202] [2024-10-12 16:09:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:39,211 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-12 16:09:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:39,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385347202] [2024-10-12 16:09:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385347202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:39,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:39,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334687112] [2024-10-12 16:09:39,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:39,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:09:39,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:09:39,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:09:39,242 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 16:09:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:39,317 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-12 16:09:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:09:39,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2024-10-12 16:09:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:39,334 INFO L225 Difference]: With dead ends: 2071 [2024-10-12 16:09:39,335 INFO L226 Difference]: Without dead ends: 1034 [2024-10-12 16:09:39,340 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-12 16:09:39,342 INFO L432 NwaCegarLoop]: 1876 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, 1876 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-12 16:09:39,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:09:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-12 16:09:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-12 16:09:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 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-12 16:09:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-12 16:09:39,408 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 19 [2024-10-12 16:09:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:39,408 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-12 16:09:39,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 16:09:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-12 16:09:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 16:09:39,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:39,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:39,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:09:39,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:39,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1708316331, now seen corresponding path program 1 times [2024-10-12 16:09:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73351417] [2024-10-12 16:09:39,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:39,490 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-12 16:09:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:39,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73351417] [2024-10-12 16:09:39,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73351417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:39,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:39,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:39,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988716106] [2024-10-12 16:09:39,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:39,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:39,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:39,497 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-12 16:09:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:43,509 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-12 16:09:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2024-10-12 16:09:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:43,517 INFO L225 Difference]: With dead ends: 2976 [2024-10-12 16:09:43,517 INFO L226 Difference]: Without dead ends: 1943 [2024-10-12 16:09:43,520 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-12 16:09:43,521 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 935 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:43,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 16:09:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-12 16:09:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-12 16:09:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 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-12 16:09:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-12 16:09:43,563 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 19 [2024-10-12 16:09:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:43,564 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-12 16:09:43,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-12 16:09:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-12 16:09:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 16:09:43,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:43,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:43,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:09:43,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:43,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash -873867679, now seen corresponding path program 1 times [2024-10-12 16:09:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:43,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991998086] [2024-10-12 16:09:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:09:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991998086] [2024-10-12 16:09:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991998086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:43,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750288605] [2024-10-12 16:09:43,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:43,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:43,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:43,836 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-12 16:09:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:47,165 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-12 16:09:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:47,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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 84 [2024-10-12 16:09:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:47,176 INFO L225 Difference]: With dead ends: 5350 [2024-10-12 16:09:47,176 INFO L226 Difference]: Without dead ends: 3479 [2024-10-12 16:09:47,179 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-12 16:09:47,179 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:47,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:09:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-12 16:09:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-12 16:09:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 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-12 16:09:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-12 16:09:47,226 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 84 [2024-10-12 16:09:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:47,227 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-12 16:09:47,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-12 16:09:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-12 16:09:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 16:09:47,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:47,229 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:09:47,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -790808676, now seen corresponding path program 1 times [2024-10-12 16:09:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427965746] [2024-10-12 16:09:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:09:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427965746] [2024-10-12 16:09:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427965746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:47,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:47,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775100572] [2024-10-12 16:09:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:47,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:47,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:47,337 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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-12 16:09:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:50,438 INFO L93 Difference]: Finished difference Result 10141 states and 15437 transitions. [2024-10-12 16:09:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:50,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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 86 [2024-10-12 16:09:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:50,455 INFO L225 Difference]: With dead ends: 10141 [2024-10-12 16:09:50,455 INFO L226 Difference]: Without dead ends: 6664 [2024-10-12 16:09:50,460 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-12 16:09:50,463 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:50,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 875 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:09:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2024-10-12 16:09:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6656. [2024-10-12 16:09:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 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-12 16:09:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-12 16:09:50,544 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 86 [2024-10-12 16:09:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:50,545 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-12 16:09:50,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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-12 16:09:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-12 16:09:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 16:09:50,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:50,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:50,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:09:50,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash 370520461, now seen corresponding path program 1 times [2024-10-12 16:09:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066024912] [2024-10-12 16:09:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:09:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066024912] [2024-10-12 16:09:50,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066024912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:50,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:50,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:50,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518000669] [2024-10-12 16:09:50,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:50,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:50,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:50,683 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-12 16:09:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:53,937 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-12 16:09:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 92 [2024-10-12 16:09:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:53,981 INFO L225 Difference]: With dead ends: 19636 [2024-10-12 16:09:53,985 INFO L226 Difference]: Without dead ends: 12981 [2024-10-12 16:09:53,998 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-12 16:09:53,999 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 792 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:53,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1160 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 16:09:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-12 16:09:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12963. [2024-10-12 16:09:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12963 states, 12962 states have (on average 1.2390834747724118) internal successors, (16061), 12962 states have internal predecessors, (16061), 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-12 16:09:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12963 states to 12963 states and 16061 transitions. [2024-10-12 16:09:54,253 INFO L78 Accepts]: Start accepts. Automaton has 12963 states and 16061 transitions. Word has length 92 [2024-10-12 16:09:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:54,253 INFO L471 AbstractCegarLoop]: Abstraction has 12963 states and 16061 transitions. [2024-10-12 16:09:54,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-12 16:09:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 12963 states and 16061 transitions. [2024-10-12 16:09:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 16:09:54,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:54,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:54,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:09:54,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:54,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1892637787, now seen corresponding path program 1 times [2024-10-12 16:09:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731399683] [2024-10-12 16:09:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 16:09:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731399683] [2024-10-12 16:09:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731399683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:54,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626514351] [2024-10-12 16:09:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:54,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:54,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:54,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:54,423 INFO L87 Difference]: Start difference. First operand 12963 states and 16061 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-12 16:09:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:57,984 INFO L93 Difference]: Finished difference Result 37780 states and 46951 transitions. [2024-10-12 16:09:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:57,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 108 [2024-10-12 16:09:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:58,019 INFO L225 Difference]: With dead ends: 37780 [2024-10-12 16:09:58,019 INFO L226 Difference]: Without dead ends: 24818 [2024-10-12 16:09:58,030 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-12 16:09:58,031 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 914 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2920 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:58,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 697 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2920 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 16:09:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24818 states. [2024-10-12 16:09:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24818 to 24811. [2024-10-12 16:09:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.2119709794437727) internal successors, (30069), 24810 states have internal predecessors, (30069), 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-12 16:09:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 30069 transitions. [2024-10-12 16:09:58,283 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 30069 transitions. Word has length 108 [2024-10-12 16:09:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:58,284 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 30069 transitions. [2024-10-12 16:09:58,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-12 16:09:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 30069 transitions. [2024-10-12 16:09:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 16:09:58,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:58,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:58,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:09:58,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:58,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1540503247, now seen corresponding path program 1 times [2024-10-12 16:09:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456662237] [2024-10-12 16:09:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:09:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456662237] [2024-10-12 16:09:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456662237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:58,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:58,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:58,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977106328] [2024-10-12 16:09:58,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:58,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:58,478 INFO L87 Difference]: Start difference. First operand 24811 states and 30069 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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-12 16:10:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:01,255 INFO L93 Difference]: Finished difference Result 44111 states and 54198 transitions. [2024-10-12 16:10:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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 135 [2024-10-12 16:10:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:01,292 INFO L225 Difference]: With dead ends: 44111 [2024-10-12 16:10:01,293 INFO L226 Difference]: Without dead ends: 24820 [2024-10-12 16:10:01,311 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-12 16:10:01,312 INFO L432 NwaCegarLoop]: 1025 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:01,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1209 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:10:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2024-10-12 16:10:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 24811. [2024-10-12 16:10:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.2105602579604997) internal successors, (30034), 24810 states have internal predecessors, (30034), 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-12 16:10:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 30034 transitions. [2024-10-12 16:10:01,566 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 30034 transitions. Word has length 135 [2024-10-12 16:10:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:01,567 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 30034 transitions. [2024-10-12 16:10:01,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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-12 16:10:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 30034 transitions. [2024-10-12 16:10:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-12 16:10:01,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:01,572 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:10:01,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:10:01,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:01,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1808815860, now seen corresponding path program 1 times [2024-10-12 16:10:01,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:01,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127299880] [2024-10-12 16:10:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:10:01,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127299880] [2024-10-12 16:10:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127299880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:01,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:10:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:10:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695727578] [2024-10-12 16:10:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:01,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:10:01,727 INFO L87 Difference]: Start difference. First operand 24811 states and 30034 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-12 16:10:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:05,036 INFO L93 Difference]: Finished difference Result 70073 states and 85508 transitions. [2024-10-12 16:10:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:05,036 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-12 16:10:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:05,093 INFO L225 Difference]: With dead ends: 70073 [2024-10-12 16:10:05,093 INFO L226 Difference]: Without dead ends: 45263 [2024-10-12 16:10:05,110 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-12 16:10:05,111 INFO L432 NwaCegarLoop]: 1847 mSDtfsCounter, 840 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:05,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1984 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:10:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45263 states. [2024-10-12 16:10:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45263 to 42892. [2024-10-12 16:10:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42892 states, 42891 states have (on average 1.1765871628080482) internal successors, (50465), 42891 states have internal predecessors, (50465), 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-12 16:10:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42892 states to 42892 states and 50465 transitions. [2024-10-12 16:10:05,491 INFO L78 Accepts]: Start accepts. Automaton has 42892 states and 50465 transitions. Word has length 233 [2024-10-12 16:10:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:05,491 INFO L471 AbstractCegarLoop]: Abstraction has 42892 states and 50465 transitions. [2024-10-12 16:10:05,491 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-12 16:10:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 42892 states and 50465 transitions. [2024-10-12 16:10:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-12 16:10:05,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:05,494 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:10:05,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:10:05,494 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:05,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1334013812, now seen corresponding path program 1 times [2024-10-12 16:10:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835820289] [2024-10-12 16:10:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-12 16:10:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835820289] [2024-10-12 16:10:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835820289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:10:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:10:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764374879] [2024-10-12 16:10:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:05,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:05,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:10:05,794 INFO L87 Difference]: Start difference. First operand 42892 states and 50465 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-12 16:10:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:08,686 INFO L93 Difference]: Finished difference Result 84996 states and 100132 transitions. [2024-10-12 16:10:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 248 [2024-10-12 16:10:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:08,729 INFO L225 Difference]: With dead ends: 84996 [2024-10-12 16:10:08,729 INFO L226 Difference]: Without dead ends: 42892 [2024-10-12 16:10:08,755 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-12 16:10:08,756 INFO L432 NwaCegarLoop]: 1064 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:08,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1193 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:10:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42892 states. [2024-10-12 16:10:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42892 to 42892. [2024-10-12 16:10:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42892 states, 42891 states have (on average 1.1764705882352942) internal successors, (50460), 42891 states have internal predecessors, (50460), 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-12 16:10:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42892 states to 42892 states and 50460 transitions. [2024-10-12 16:10:09,436 INFO L78 Accepts]: Start accepts. Automaton has 42892 states and 50460 transitions. Word has length 248 [2024-10-12 16:10:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:09,436 INFO L471 AbstractCegarLoop]: Abstraction has 42892 states and 50460 transitions. [2024-10-12 16:10:09,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-12 16:10:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42892 states and 50460 transitions. [2024-10-12 16:10:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-12 16:10:09,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:09,448 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 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-12 16:10:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:10:09,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1504502843, now seen corresponding path program 1 times [2024-10-12 16:10:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18279295] [2024-10-12 16:10:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:10:09,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:09,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18279295] [2024-10-12 16:10:09,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18279295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:09,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:10:09,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:10:09,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728992692] [2024-10-12 16:10:09,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:09,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:09,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:09,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:09,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:10:09,868 INFO L87 Difference]: Start difference. First operand 42892 states and 50460 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-12 16:10:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:13,258 INFO L93 Difference]: Finished difference Result 104681 states and 125380 transitions. [2024-10-12 16:10:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:13,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 255 [2024-10-12 16:10:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:13,329 INFO L225 Difference]: With dead ends: 104681 [2024-10-12 16:10:13,329 INFO L226 Difference]: Without dead ends: 62577 [2024-10-12 16:10:13,358 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-12 16:10:13,359 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 882 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:13,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 928 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 16:10:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62577 states. [2024-10-12 16:10:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62577 to 60993. [2024-10-12 16:10:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60993 states, 60992 states have (on average 1.1660545645330536) internal successors, (71120), 60992 states have internal predecessors, (71120), 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-12 16:10:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60993 states to 60993 states and 71120 transitions. [2024-10-12 16:10:14,103 INFO L78 Accepts]: Start accepts. Automaton has 60993 states and 71120 transitions. Word has length 255 [2024-10-12 16:10:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:14,104 INFO L471 AbstractCegarLoop]: Abstraction has 60993 states and 71120 transitions. [2024-10-12 16:10:14,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-12 16:10:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 60993 states and 71120 transitions. [2024-10-12 16:10:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-12 16:10:14,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:14,107 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:10:14,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:10:14,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:14,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 682756360, now seen corresponding path program 1 times [2024-10-12 16:10:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230852618] [2024-10-12 16:10:14,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:10:15,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:15,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230852618] [2024-10-12 16:10:15,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230852618] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:10:15,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820779708] [2024-10-12 16:10:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:15,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:10:15,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:10:15,506 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-12 16:10:15,508 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-12 16:10:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:15,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:10:15,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:10:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-12 16:10:15,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:10:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820779708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:10:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 16:10:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117251949] [2024-10-12 16:10:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:10:15,721 INFO L87 Difference]: Start difference. First operand 60993 states and 71120 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-12 16:10:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:18,252 INFO L93 Difference]: Finished difference Result 121196 states and 141446 transitions. [2024-10-12 16:10:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 260 [2024-10-12 16:10:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:18,337 INFO L225 Difference]: With dead ends: 121196 [2024-10-12 16:10:18,337 INFO L226 Difference]: Without dead ends: 60991 [2024-10-12 16:10:18,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:10:18,374 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 1187 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:18,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1436 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:10:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60991 states. [2024-10-12 16:10:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60991 to 60990. [2024-10-12 16:10:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60990 states, 60989 states have (on average 1.1285313745101575) internal successors, (68828), 60989 states have internal predecessors, (68828), 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-12 16:10:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60990 states to 60990 states and 68828 transitions. [2024-10-12 16:10:19,112 INFO L78 Accepts]: Start accepts. Automaton has 60990 states and 68828 transitions. Word has length 260 [2024-10-12 16:10:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:19,112 INFO L471 AbstractCegarLoop]: Abstraction has 60990 states and 68828 transitions. [2024-10-12 16:10:19,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-12 16:10:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 60990 states and 68828 transitions. [2024-10-12 16:10:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-12 16:10:19,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:19,116 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:10:19,135 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-12 16:10:19,320 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,SelfDestructingSolverStorable10 [2024-10-12 16:10:19,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:19,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 554785925, now seen corresponding path program 1 times [2024-10-12 16:10:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097210422] [2024-10-12 16:10:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-12 16:10:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097210422] [2024-10-12 16:10:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097210422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:10:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:10:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007155685] [2024-10-12 16:10:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:19,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:19,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:10:19,806 INFO L87 Difference]: Start difference. First operand 60990 states and 68828 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-12 16:10:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:23,752 INFO L93 Difference]: Finished difference Result 140088 states and 159777 transitions. [2024-10-12 16:10:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 310 [2024-10-12 16:10:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:23,862 INFO L225 Difference]: With dead ends: 140088 [2024-10-12 16:10:23,862 INFO L226 Difference]: Without dead ends: 79886 [2024-10-12 16:10:23,895 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-12 16:10:23,896 INFO L432 NwaCegarLoop]: 1808 mSDtfsCounter, 840 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:23,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1950 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-12 16:10:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79886 states. [2024-10-12 16:10:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79886 to 79095. [2024-10-12 16:10:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79095 states, 79094 states have (on average 1.1100083445014792) internal successors, (87795), 79094 states have internal predecessors, (87795), 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-12 16:10:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79095 states to 79095 states and 87795 transitions. [2024-10-12 16:10:24,805 INFO L78 Accepts]: Start accepts. Automaton has 79095 states and 87795 transitions. Word has length 310 [2024-10-12 16:10:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:24,806 INFO L471 AbstractCegarLoop]: Abstraction has 79095 states and 87795 transitions. [2024-10-12 16:10:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-12 16:10:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 79095 states and 87795 transitions. [2024-10-12 16:10:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-12 16:10:24,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:24,817 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:10:24,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:10:24,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:24,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:24,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1195026524, now seen corresponding path program 1 times [2024-10-12 16:10:24,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:24,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742225083] [2024-10-12 16:10:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:24,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 167 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:10:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742225083] [2024-10-12 16:10:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742225083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:10:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793187944] [2024-10-12 16:10:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:26,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:10:26,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:10:26,204 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-12 16:10:26,206 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-12 16:10:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:26,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:10:26,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:10:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-12 16:10:26,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:10:26,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793187944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:26,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:10:26,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:10:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006400971] [2024-10-12 16:10:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:26,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:10:26,409 INFO L87 Difference]: Start difference. First operand 79095 states and 87795 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-12 16:10:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:29,185 INFO L93 Difference]: Finished difference Result 157393 states and 174789 transitions. [2024-10-12 16:10:29,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:29,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 325 [2024-10-12 16:10:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:29,272 INFO L225 Difference]: With dead ends: 157393 [2024-10-12 16:10:29,273 INFO L226 Difference]: Without dead ends: 79086 [2024-10-12 16:10:29,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:10:29,321 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 1073 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:29,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 809 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:10:29,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79086 states. [2024-10-12 16:10:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79086 to 79085. [2024-10-12 16:10:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79085 states, 79084 states have (on average 1.0809013201153204) internal successors, (85482), 79084 states have internal predecessors, (85482), 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-12 16:10:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79085 states to 79085 states and 85482 transitions. [2024-10-12 16:10:30,216 INFO L78 Accepts]: Start accepts. Automaton has 79085 states and 85482 transitions. Word has length 325 [2024-10-12 16:10:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:30,216 INFO L471 AbstractCegarLoop]: Abstraction has 79085 states and 85482 transitions. [2024-10-12 16:10:30,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-12 16:10:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 79085 states and 85482 transitions. [2024-10-12 16:10:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-12 16:10:30,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:30,225 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-12 16:10:30,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 16:10:30,425 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,SelfDestructingSolverStorable12 [2024-10-12 16:10:30,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:30,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -281232766, now seen corresponding path program 1 times [2024-10-12 16:10:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166398932] [2024-10-12 16:10:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-12 16:10:30,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:30,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166398932] [2024-10-12 16:10:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166398932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:30,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:10:30,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:10:30,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626686624] [2024-10-12 16:10:30,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:30,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:10:30,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:10:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:10:30,622 INFO L87 Difference]: Start difference. First operand 79085 states and 85482 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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-12 16:10:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:38,060 INFO L93 Difference]: Finished difference Result 221340 states and 239936 transitions. [2024-10-12 16:10:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:10:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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 367 [2024-10-12 16:10:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:38,227 INFO L225 Difference]: With dead ends: 221340 [2024-10-12 16:10:38,228 INFO L226 Difference]: Without dead ends: 143043 [2024-10-12 16:10:38,265 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-12 16:10:38,265 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 1707 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 6621 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 6621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:38,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 783 Invalid, 7660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 6621 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-12 16:10:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143043 states. [2024-10-12 16:10:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143043 to 139765. [2024-10-12 16:10:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139765 states, 139764 states have (on average 1.0780530036346985) internal successors, (150673), 139764 states have internal predecessors, (150673), 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-12 16:10:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139765 states to 139765 states and 150673 transitions. [2024-10-12 16:10:39,833 INFO L78 Accepts]: Start accepts. Automaton has 139765 states and 150673 transitions. Word has length 367 [2024-10-12 16:10:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:39,834 INFO L471 AbstractCegarLoop]: Abstraction has 139765 states and 150673 transitions. [2024-10-12 16:10:39,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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-12 16:10:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 139765 states and 150673 transitions. [2024-10-12 16:10:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-12 16:10:39,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:39,837 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:10:39,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:10:39,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:39,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash -467210533, now seen corresponding path program 1 times [2024-10-12 16:10:39,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:39,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414765757] [2024-10-12 16:10:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 251 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:10:40,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414765757] [2024-10-12 16:10:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414765757] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:10:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513964987] [2024-10-12 16:10:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:40,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:10:40,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:10:40,964 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-12 16:10:40,970 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-12 16:10:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:41,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:10:41,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:10:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-12 16:10:41,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:10:41,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513964987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:41,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:10:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:10:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223936886] [2024-10-12 16:10:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:41,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:41,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:41,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:41,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:10:41,242 INFO L87 Difference]: Start difference. First operand 139765 states and 150673 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-12 16:10:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:44,963 INFO L93 Difference]: Finished difference Result 276365 states and 299724 transitions. [2024-10-12 16:10:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:44,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 367 [2024-10-12 16:10:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:45,138 INFO L225 Difference]: With dead ends: 276365 [2024-10-12 16:10:45,139 INFO L226 Difference]: Without dead ends: 151564 [2024-10-12 16:10:45,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:10:45,201 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1214 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:45,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 403 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:10:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151564 states. [2024-10-12 16:10:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151564 to 151564. [2024-10-12 16:10:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151564 states, 151563 states have (on average 1.0783436590724649) internal successors, (163437), 151563 states have internal predecessors, (163437), 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-12 16:10:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151564 states to 151564 states and 163437 transitions. [2024-10-12 16:10:47,369 INFO L78 Accepts]: Start accepts. Automaton has 151564 states and 163437 transitions. Word has length 367 [2024-10-12 16:10:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:47,370 INFO L471 AbstractCegarLoop]: Abstraction has 151564 states and 163437 transitions. [2024-10-12 16:10:47,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-12 16:10:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 151564 states and 163437 transitions. [2024-10-12 16:10:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-10-12 16:10:47,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:47,375 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:10:47,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 16:10:47,578 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-12 16:10:47,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2096681402, now seen corresponding path program 1 times [2024-10-12 16:10:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:47,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281298258] [2024-10-12 16:10:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 336 proven. 110 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-12 16:10:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281298258] [2024-10-12 16:10:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281298258] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:10:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662203319] [2024-10-12 16:10:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:48,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:10:48,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:10:48,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:10:48,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 16:10:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:48,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:10:48,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:10:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2024-10-12 16:10:48,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:10:48,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662203319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:48,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:10:48,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:10:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539855733] [2024-10-12 16:10:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:48,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:48,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:48,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:48,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:10:48,720 INFO L87 Difference]: Start difference. First operand 151564 states and 163437 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-12 16:10:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:10:52,980 INFO L93 Difference]: Finished difference Result 303914 states and 327667 transitions. [2024-10-12 16:10:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:10:52,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 410 [2024-10-12 16:10:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:10:53,268 INFO L225 Difference]: With dead ends: 303914 [2024-10-12 16:10:53,268 INFO L226 Difference]: Without dead ends: 153138 [2024-10-12 16:10:53,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:10:53,394 INFO L432 NwaCegarLoop]: 1384 mSDtfsCounter, 1018 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:10:53,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1467 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:10:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153138 states. [2024-10-12 16:10:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153138 to 151549. [2024-10-12 16:10:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151549 states, 151548 states have (on average 1.0654512101776334) internal successors, (161467), 151548 states have internal predecessors, (161467), 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-12 16:10:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151549 states to 151549 states and 161467 transitions. [2024-10-12 16:10:55,490 INFO L78 Accepts]: Start accepts. Automaton has 151549 states and 161467 transitions. Word has length 410 [2024-10-12 16:10:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:55,491 INFO L471 AbstractCegarLoop]: Abstraction has 151549 states and 161467 transitions. [2024-10-12 16:10:55,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-12 16:10:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 151549 states and 161467 transitions. [2024-10-12 16:10:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-12 16:10:55,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:55,498 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:10:55,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 16:10:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 16:10:55,703 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:55,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1932067565, now seen corresponding path program 1 times [2024-10-12 16:10:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952479078] [2024-10-12 16:10:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 369 proven. 113 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-12 16:10:57,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:57,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952479078] [2024-10-12 16:10:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952479078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:10:57,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927481956] [2024-10-12 16:10:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:57,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:10:57,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:10:57,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:10:57,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 16:10:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:57,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:10:57,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:10:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-10-12 16:10:57,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:10:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927481956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:57,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:10:57,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 16:10:57,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563775968] [2024-10-12 16:10:57,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:57,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:57,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:10:57,594 INFO L87 Difference]: Start difference. First operand 151549 states and 161467 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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)