./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/Problem18_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.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 b09204eec7fef585004b69b471b657e04a2a46cceef0cdf26e228e2dd271c194 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:04:30,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:04:30,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:04:30,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:04:30,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:04:30,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:04:30,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:04:30,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:04:30,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:04:30,189 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:04:30,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:04:30,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:04:30,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:04:30,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:04:30,191 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:04:30,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:04:30,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:04:30,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:04:30,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:04:30,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:04:30,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:04:30,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:04:30,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:04:30,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:04:30,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:04:30,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:04:30,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:04:30,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:04:30,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:04:30,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:04:30,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:04:30,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:04:30,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:04:30,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:04:30,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:04:30,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:04:30,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:04:30,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:04:30,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:04:30,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:04:30,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:04:30,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:04:30,202 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 -> b09204eec7fef585004b69b471b657e04a2a46cceef0cdf26e228e2dd271c194 [2024-10-14 00:04:30,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:04:30,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:04:30,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:04:30,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:04:30,542 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:04:30,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.c [2024-10-14 00:04:32,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:04:32,517 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:04:32,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.c [2024-10-14 00:04:32,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0b63ff/1af3aec7ca9c42b393cbb85c363c7973/FLAGe98c97933 [2024-10-14 00:04:32,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0b63ff/1af3aec7ca9c42b393cbb85c363c7973 [2024-10-14 00:04:32,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:04:32,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:04:32,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:04:32,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:04:32,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:04:32,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:04:32" (1/1) ... [2024-10-14 00:04:32,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d135a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:32, skipping insertion in model container [2024-10-14 00:04:32,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:04:32" (1/1) ... [2024-10-14 00:04:32,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:04:32,992 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/Problem18_label51.c[6263,6276] [2024-10-14 00:04:33,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:04:33,822 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:04:33,855 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/Problem18_label51.c[6263,6276] [2024-10-14 00:04:34,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:04:34,173 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:04:34,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34 WrapperNode [2024-10-14 00:04:34,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:04:34,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:04:34,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:04:34,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:04:34,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,422 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-10-14 00:04:34,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:04:34,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:04:34,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:04:34,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:04:34,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,703 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-14 00:04:34,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:04:34,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:04:34,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:04:34,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:04:34,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (1/1) ... [2024-10-14 00:04:34,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:04:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:04:34,990 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-14 00:04:34,996 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-14 00:04:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:04:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:04:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:04:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:04:35,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:04:35,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:04:38,557 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-10-14 00:04:38,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:04:38,639 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:04:38,641 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 00:04:38,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:04:38 BoogieIcfgContainer [2024-10-14 00:04:38,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:04:38,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:04:38,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:04:38,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:04:38,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:04:32" (1/3) ... [2024-10-14 00:04:38,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0fe934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:04:38, skipping insertion in model container [2024-10-14 00:04:38,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:04:34" (2/3) ... [2024-10-14 00:04:38,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0fe934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:04:38, skipping insertion in model container [2024-10-14 00:04:38,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:04:38" (3/3) ... [2024-10-14 00:04:38,657 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label51.c [2024-10-14 00:04:38,676 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:04:38,677 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:04:38,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:04:38,834 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;@1df983cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:04:38,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:04:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 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-14 00:04:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 00:04:38,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:04:38,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:04:38,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:04:38,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:04:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1677427773, now seen corresponding path program 1 times [2024-10-14 00:04:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:04:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252800749] [2024-10-14 00:04:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:04:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:39,072 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-14 00:04:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:04:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252800749] [2024-10-14 00:04:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252800749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:04:39,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:04:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:04:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233944544] [2024-10-14 00:04:39,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:04:39,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:04:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:04:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:04:39,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:04:39,117 INFO L87 Difference]: Start difference. First operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:04:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:04:39,214 INFO L93 Difference]: Finished difference Result 1389 states and 2763 transitions. [2024-10-14 00:04:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:04:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 00:04:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:04:39,242 INFO L225 Difference]: With dead ends: 1389 [2024-10-14 00:04:39,243 INFO L226 Difference]: Without dead ends: 693 [2024-10-14 00:04:39,249 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-14 00:04:39,254 INFO L432 NwaCegarLoop]: 1317 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, 1317 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-14 00:04:39,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:04:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-14 00:04:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-14 00:04:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 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-14 00:04:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2024-10-14 00:04:39,336 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 59 [2024-10-14 00:04:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:04:39,337 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2024-10-14 00:04:39,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:04:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2024-10-14 00:04:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 00:04:39,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:04:39,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:04:39,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:04:39,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:04:39,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:04:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash 306654237, now seen corresponding path program 1 times [2024-10-14 00:04:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:04:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716750398] [2024-10-14 00:04:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:39,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:04:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:39,577 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-14 00:04:39,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:04:39,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716750398] [2024-10-14 00:04:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716750398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:04:39,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:04:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:04:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031449648] [2024-10-14 00:04:39,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:04:39,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:04:39,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:04:39,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:04:39,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:04:39,586 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:04:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:04:42,744 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2024-10-14 00:04:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:04:42,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 00:04:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:04:42,751 INFO L225 Difference]: With dead ends: 2075 [2024-10-14 00:04:42,752 INFO L226 Difference]: Without dead ends: 1383 [2024-10-14 00:04:42,753 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-14 00:04:42,754 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 716 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:04:42,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 435 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 00:04:42,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-10-14 00:04:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2024-10-14 00:04:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.5998552821997105) internal successors, (2211), 1382 states have internal predecessors, (2211), 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-14 00:04:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2211 transitions. [2024-10-14 00:04:42,812 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2211 transitions. Word has length 59 [2024-10-14 00:04:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:04:42,812 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2211 transitions. [2024-10-14 00:04:42,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:04:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2211 transitions. [2024-10-14 00:04:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 00:04:42,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:04:42,818 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:04:42,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:04:42,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:04:42,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:04:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash -710014281, now seen corresponding path program 1 times [2024-10-14 00:04:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:04:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613707950] [2024-10-14 00:04:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:04:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:04:43,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:04:43,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613707950] [2024-10-14 00:04:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613707950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:04:43,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:04:43,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:04:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666542442] [2024-10-14 00:04:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:04:43,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:04:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:04:43,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:04:43,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:04:43,055 INFO L87 Difference]: Start difference. First operand 1383 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:04:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:04:46,099 INFO L93 Difference]: Finished difference Result 4145 states and 6630 transitions. [2024-10-14 00:04:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:04:46,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-14 00:04:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:04:46,112 INFO L225 Difference]: With dead ends: 4145 [2024-10-14 00:04:46,112 INFO L226 Difference]: Without dead ends: 2763 [2024-10-14 00:04:46,115 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-14 00:04:46,117 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 00:04:46,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 527 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 00:04:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2024-10-14 00:04:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2024-10-14 00:04:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.3504706734250542) internal successors, (3730), 2762 states have internal predecessors, (3730), 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-14 00:04:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3730 transitions. [2024-10-14 00:04:46,188 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3730 transitions. Word has length 124 [2024-10-14 00:04:46,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:04:46,189 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3730 transitions. [2024-10-14 00:04:46,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:04:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3730 transitions. [2024-10-14 00:04:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-14 00:04:46,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:04:46,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:04:46,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:04:46,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:04:46,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:04:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -146279344, now seen corresponding path program 1 times [2024-10-14 00:04:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:04:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55719864] [2024-10-14 00:04:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:04:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 00:04:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:04:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55719864] [2024-10-14 00:04:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55719864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:04:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:04:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:04:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460728189] [2024-10-14 00:04:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:04:46,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:04:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:04:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:04:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:04:46,982 INFO L87 Difference]: Start difference. First operand 2763 states and 3730 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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-14 00:04:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:04:50,390 INFO L93 Difference]: Finished difference Result 6905 states and 9073 transitions. [2024-10-14 00:04:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:04:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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 242 [2024-10-14 00:04:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:04:50,409 INFO L225 Difference]: With dead ends: 6905 [2024-10-14 00:04:50,409 INFO L226 Difference]: Without dead ends: 4143 [2024-10-14 00:04:50,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:04:50,419 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 4275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 00:04:50,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 638 Invalid, 4275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 00:04:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2024-10-14 00:04:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4143. [2024-10-14 00:04:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.2467407049734427) internal successors, (5164), 4142 states have internal predecessors, (5164), 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-14 00:04:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5164 transitions. [2024-10-14 00:04:50,515 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5164 transitions. Word has length 242 [2024-10-14 00:04:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:04:50,515 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5164 transitions. [2024-10-14 00:04:50,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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-14 00:04:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5164 transitions. [2024-10-14 00:04:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-14 00:04:50,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:04:50,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:04:50,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:04:50,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:04:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:04:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash -824439251, now seen corresponding path program 1 times [2024-10-14 00:04:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:04:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96789286] [2024-10-14 00:04:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:04:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 00:04:51,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:04:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96789286] [2024-10-14 00:04:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96789286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 00:04:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906873420] [2024-10-14 00:04:51,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:51,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:04:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:04:51,114 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-14 00:04:51,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 00:04:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:51,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:04:51,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:04:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-14 00:04:51,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:04:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906873420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:04:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 00:04:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-14 00:04:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855973455] [2024-10-14 00:04:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:04:51,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:04:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:04:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:04:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:04:51,793 INFO L87 Difference]: Start difference. First operand 4143 states and 5164 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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-14 00:04:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:04:54,140 INFO L93 Difference]: Finished difference Result 11045 states and 14055 transitions. [2024-10-14 00:04:54,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:04:54,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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 358 [2024-10-14 00:04:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:04:54,163 INFO L225 Difference]: With dead ends: 11045 [2024-10-14 00:04:54,163 INFO L226 Difference]: Without dead ends: 6903 [2024-10-14 00:04:54,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:04:54,172 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:04:54,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 548 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 00:04:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2024-10-14 00:04:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6213. [2024-10-14 00:04:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 6212 states have (on average 1.2398583386992916) internal successors, (7702), 6212 states have internal predecessors, (7702), 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-14 00:04:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 7702 transitions. [2024-10-14 00:04:54,305 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 7702 transitions. Word has length 358 [2024-10-14 00:04:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:04:54,309 INFO L471 AbstractCegarLoop]: Abstraction has 6213 states and 7702 transitions. [2024-10-14 00:04:54,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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-14 00:04:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 7702 transitions. [2024-10-14 00:04:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-14 00:04:54,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:04:54,317 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:04:54,336 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-14 00:04:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:04:54,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:04:54,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:04:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1953913407, now seen corresponding path program 1 times [2024-10-14 00:04:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:04:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859920734] [2024-10-14 00:04:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:04:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-10-14 00:04:55,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:04:55,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859920734] [2024-10-14 00:04:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859920734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:04:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:04:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:04:55,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844431128] [2024-10-14 00:04:55,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:04:55,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:04:55,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:04:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:04:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:04:55,087 INFO L87 Difference]: Start difference. First operand 6213 states and 7702 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 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-14 00:04:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:04:57,485 INFO L93 Difference]: Finished difference Result 13858 states and 16878 transitions. [2024-10-14 00:04:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:04:57,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 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 428 [2024-10-14 00:04:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:04:57,539 INFO L225 Difference]: With dead ends: 13858 [2024-10-14 00:04:57,540 INFO L226 Difference]: Without dead ends: 7593 [2024-10-14 00:04:57,549 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-14 00:04:57,553 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 529 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 00:04:57,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 634 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 00:04:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2024-10-14 00:04:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 7593. [2024-10-14 00:04:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7593 states, 7592 states have (on average 1.1513435194942043) internal successors, (8741), 7592 states have internal predecessors, (8741), 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-14 00:04:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 8741 transitions. [2024-10-14 00:04:57,726 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 8741 transitions. Word has length 428 [2024-10-14 00:04:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:04:57,727 INFO L471 AbstractCegarLoop]: Abstraction has 7593 states and 8741 transitions. [2024-10-14 00:04:57,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 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-14 00:04:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 8741 transitions. [2024-10-14 00:04:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-14 00:04:57,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:04:57,735 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:04:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 00:04:57,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:04:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:04:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash -558695947, now seen corresponding path program 1 times [2024-10-14 00:04:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:04:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770126462] [2024-10-14 00:04:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:04:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:04:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:04:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-14 00:04:58,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:04:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770126462] [2024-10-14 00:04:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770126462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:04:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:04:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:04:58,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808589513] [2024-10-14 00:04:58,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:04:58,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:04:58,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:04:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:04:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:04:58,234 INFO L87 Difference]: Start difference. First operand 7593 states and 8741 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:05:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:00,075 INFO L93 Difference]: Finished difference Result 18635 states and 21310 transitions. [2024-10-14 00:05:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:00,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2024-10-14 00:05:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:00,105 INFO L225 Difference]: With dead ends: 18635 [2024-10-14 00:05:00,105 INFO L226 Difference]: Without dead ends: 11043 [2024-10-14 00:05:00,117 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-14 00:05:00,118 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:00,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 424 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 00:05:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2024-10-14 00:05:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 11043. [2024-10-14 00:05:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11043 states, 11042 states have (on average 1.1249773591740626) internal successors, (12422), 11042 states have internal predecessors, (12422), 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-14 00:05:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11043 states to 11043 states and 12422 transitions. [2024-10-14 00:05:00,333 INFO L78 Accepts]: Start accepts. Automaton has 11043 states and 12422 transitions. Word has length 443 [2024-10-14 00:05:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:00,334 INFO L471 AbstractCegarLoop]: Abstraction has 11043 states and 12422 transitions. [2024-10-14 00:05:00,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:05:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 11043 states and 12422 transitions. [2024-10-14 00:05:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-10-14 00:05:00,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:00,343 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:05:00,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 00:05:00,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:00,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1535278305, now seen corresponding path program 1 times [2024-10-14 00:05:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719422843] [2024-10-14 00:05:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:05:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719422843] [2024-10-14 00:05:00,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719422843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:00,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:05:00,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:05:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676424107] [2024-10-14 00:05:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:00,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:05:00,926 INFO L87 Difference]: Start difference. First operand 11043 states and 12422 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-14 00:05:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:02,888 INFO L93 Difference]: Finished difference Result 30365 states and 34441 transitions. [2024-10-14 00:05:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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 451 [2024-10-14 00:05:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:02,924 INFO L225 Difference]: With dead ends: 30365 [2024-10-14 00:05:02,924 INFO L226 Difference]: Without dead ends: 19323 [2024-10-14 00:05:02,938 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-14 00:05:02,940 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 601 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:02,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 975 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 00:05:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19323 states. [2024-10-14 00:05:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19323 to 18633. [2024-10-14 00:05:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.1019214255045084) internal successors, (20531), 18632 states have internal predecessors, (20531), 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-14 00:05:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 20531 transitions. [2024-10-14 00:05:03,220 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 20531 transitions. Word has length 451 [2024-10-14 00:05:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:03,221 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 20531 transitions. [2024-10-14 00:05:03,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-14 00:05:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 20531 transitions. [2024-10-14 00:05:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-10-14 00:05:03,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:03,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:05:03,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 00:05:03,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1101784290, now seen corresponding path program 1 times [2024-10-14 00:05:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029930795] [2024-10-14 00:05:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-14 00:05:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:03,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029930795] [2024-10-14 00:05:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029930795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:05:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:05:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516250841] [2024-10-14 00:05:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:03,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:03,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:05:03,534 INFO L87 Difference]: Start difference. First operand 18633 states and 20531 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-14 00:05:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:05,787 INFO L93 Difference]: Finished difference Result 43475 states and 48493 transitions. [2024-10-14 00:05:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:05,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 458 [2024-10-14 00:05:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:05,842 INFO L225 Difference]: With dead ends: 43475 [2024-10-14 00:05:05,843 INFO L226 Difference]: Without dead ends: 25533 [2024-10-14 00:05:05,865 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-14 00:05:05,866 INFO L432 NwaCegarLoop]: 1146 mSDtfsCounter, 633 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:05,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1152 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 00:05:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2024-10-14 00:05:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 24843. [2024-10-14 00:05:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24843 states, 24842 states have (on average 1.094597858465502) internal successors, (27192), 24842 states have internal predecessors, (27192), 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-14 00:05:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 27192 transitions. [2024-10-14 00:05:06,226 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 27192 transitions. Word has length 458 [2024-10-14 00:05:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:06,227 INFO L471 AbstractCegarLoop]: Abstraction has 24843 states and 27192 transitions. [2024-10-14 00:05:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-14 00:05:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 27192 transitions. [2024-10-14 00:05:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-14 00:05:06,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:06,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:05:06,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 00:05:06,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:06,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash -195819049, now seen corresponding path program 1 times [2024-10-14 00:05:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033960659] [2024-10-14 00:05:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-14 00:05:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033960659] [2024-10-14 00:05:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033960659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:05:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:05:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390379543] [2024-10-14 00:05:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:07,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:05:07,114 INFO L87 Difference]: Start difference. First operand 24843 states and 27192 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-14 00:05:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:09,081 INFO L93 Difference]: Finished difference Result 48995 states and 53690 transitions. [2024-10-14 00:05:09,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:09,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 483 [2024-10-14 00:05:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:09,127 INFO L225 Difference]: With dead ends: 48995 [2024-10-14 00:05:09,127 INFO L226 Difference]: Without dead ends: 24843 [2024-10-14 00:05:09,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-14 00:05:09,145 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 737 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:09,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 777 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 00:05:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24843 states. [2024-10-14 00:05:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24843 to 24843. [2024-10-14 00:05:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24843 states, 24842 states have (on average 1.0762418484824088) internal successors, (26736), 24842 states have internal predecessors, (26736), 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-14 00:05:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 26736 transitions. [2024-10-14 00:05:09,466 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 26736 transitions. Word has length 483 [2024-10-14 00:05:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:09,467 INFO L471 AbstractCegarLoop]: Abstraction has 24843 states and 26736 transitions. [2024-10-14 00:05:09,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-14 00:05:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 26736 transitions. [2024-10-14 00:05:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-10-14 00:05:09,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:09,479 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:05:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 00:05:09,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2135173432, now seen corresponding path program 1 times [2024-10-14 00:05:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833912767] [2024-10-14 00:05:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-14 00:05:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833912767] [2024-10-14 00:05:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833912767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:09,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:05:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:05:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034744062] [2024-10-14 00:05:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:09,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:09,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:09,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:05:09,900 INFO L87 Difference]: Start difference. First operand 24843 states and 26736 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-14 00:05:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:11,965 INFO L93 Difference]: Finished difference Result 55205 states and 60039 transitions. [2024-10-14 00:05:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:11,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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 601 [2024-10-14 00:05:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:12,014 INFO L225 Difference]: With dead ends: 55205 [2024-10-14 00:05:12,014 INFO L226 Difference]: Without dead ends: 28293 [2024-10-14 00:05:12,040 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-14 00:05:12,040 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 609 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:12,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1094 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 00:05:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28293 states. [2024-10-14 00:05:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28293 to 28293. [2024-10-14 00:05:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28293 states, 28292 states have (on average 1.0739431641453414) internal successors, (30384), 28292 states have internal predecessors, (30384), 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-14 00:05:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28293 states to 28293 states and 30384 transitions. [2024-10-14 00:05:12,365 INFO L78 Accepts]: Start accepts. Automaton has 28293 states and 30384 transitions. Word has length 601 [2024-10-14 00:05:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:12,365 INFO L471 AbstractCegarLoop]: Abstraction has 28293 states and 30384 transitions. [2024-10-14 00:05:12,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-14 00:05:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28293 states and 30384 transitions. [2024-10-14 00:05:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-10-14 00:05:12,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:12,378 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:05:12,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 00:05:12,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:12,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1501464110, now seen corresponding path program 1 times [2024-10-14 00:05:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629963425] [2024-10-14 00:05:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:12,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 533 proven. 32 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-14 00:05:13,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629963425] [2024-10-14 00:05:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629963425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 00:05:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930723291] [2024-10-14 00:05:13,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:13,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:05:13,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:05:13,395 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-14 00:05:13,397 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-14 00:05:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:13,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:05:13,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:05:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-10-14 00:05:13,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:05:13,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930723291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:13,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 00:05:13,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-14 00:05:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803043132] [2024-10-14 00:05:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:13,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:13,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:13,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:05:13,718 INFO L87 Difference]: Start difference. First operand 28293 states and 30384 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-14 00:05:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:15,784 INFO L93 Difference]: Finished difference Result 62105 states and 67212 transitions. [2024-10-14 00:05:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:15,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 637 [2024-10-14 00:05:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:15,823 INFO L225 Difference]: With dead ends: 62105 [2024-10-14 00:05:15,823 INFO L226 Difference]: Without dead ends: 33813 [2024-10-14 00:05:15,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:05:15,837 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 643 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:15,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1001 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 00:05:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33813 states. [2024-10-14 00:05:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33813 to 32433. [2024-10-14 00:05:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32433 states, 32432 states have (on average 1.0797360631475086) internal successors, (35018), 32432 states have internal predecessors, (35018), 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-14 00:05:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32433 states to 32433 states and 35018 transitions. [2024-10-14 00:05:16,165 INFO L78 Accepts]: Start accepts. Automaton has 32433 states and 35018 transitions. Word has length 637 [2024-10-14 00:05:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:16,166 INFO L471 AbstractCegarLoop]: Abstraction has 32433 states and 35018 transitions. [2024-10-14 00:05:16,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-14 00:05:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 32433 states and 35018 transitions. [2024-10-14 00:05:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2024-10-14 00:05:16,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:16,199 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:05:16,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 00:05:16,399 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,SelfDestructingSolverStorable11 [2024-10-14 00:05:16,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 255316216, now seen corresponding path program 1 times [2024-10-14 00:05:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113022847] [2024-10-14 00:05:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 538 proven. 117 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 00:05:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113022847] [2024-10-14 00:05:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113022847] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 00:05:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928800320] [2024-10-14 00:05:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:05:18,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:05:18,389 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-14 00:05:18,391 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-14 00:05:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:18,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:05:18,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:05:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-14 00:05:19,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:05:19,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928800320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:19,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 00:05:19,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-14 00:05:19,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530361238] [2024-10-14 00:05:19,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:19,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:19,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:19,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 00:05:19,146 INFO L87 Difference]: Start difference. First operand 32433 states and 35018 transitions. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-14 00:05:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:21,072 INFO L93 Difference]: Finished difference Result 75215 states and 82020 transitions. [2024-10-14 00:05:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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 912 [2024-10-14 00:05:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:21,125 INFO L225 Difference]: With dead ends: 75215 [2024-10-14 00:05:21,125 INFO L226 Difference]: Without dead ends: 43473 [2024-10-14 00:05:21,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 911 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 00:05:21,152 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 341 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:21,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 218 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 00:05:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43473 states. [2024-10-14 00:05:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43473 to 43473. [2024-10-14 00:05:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43473 states, 43472 states have (on average 1.0783262789841737) internal successors, (46877), 43472 states have internal predecessors, (46877), 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-14 00:05:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43473 states to 43473 states and 46877 transitions. [2024-10-14 00:05:21,754 INFO L78 Accepts]: Start accepts. Automaton has 43473 states and 46877 transitions. Word has length 912 [2024-10-14 00:05:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:21,755 INFO L471 AbstractCegarLoop]: Abstraction has 43473 states and 46877 transitions. [2024-10-14 00:05:21,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-14 00:05:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 43473 states and 46877 transitions. [2024-10-14 00:05:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2024-10-14 00:05:21,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:21,790 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:05:21,808 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-14 00:05:21,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:05:21,991 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash -819196692, now seen corresponding path program 1 times [2024-10-14 00:05:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:21,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751969429] [2024-10-14 00:05:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 789 proven. 32 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-14 00:05:23,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:23,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751969429] [2024-10-14 00:05:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751969429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 00:05:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167103569] [2024-10-14 00:05:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:23,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:05:23,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:05:23,102 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-14 00:05:23,103 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-14 00:05:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:23,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:05:23,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:05:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-14 00:05:23,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:05:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167103569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 00:05:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-14 00:05:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590135076] [2024-10-14 00:05:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:23,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:23,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:05:23,885 INFO L87 Difference]: Start difference. First operand 43473 states and 46877 transitions. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-14 00:05:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:25,810 INFO L93 Difference]: Finished difference Result 86255 states and 93060 transitions. [2024-10-14 00:05:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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 937 [2024-10-14 00:05:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:25,870 INFO L225 Difference]: With dead ends: 86255 [2024-10-14 00:05:25,870 INFO L226 Difference]: Without dead ends: 43473 [2024-10-14 00:05:25,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 937 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:05:25,901 INFO L432 NwaCegarLoop]: 983 mSDtfsCounter, 374 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:25,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 989 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 00:05:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43473 states. [2024-10-14 00:05:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43473 to 43473. [2024-10-14 00:05:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43473 states, 43472 states have (on average 1.0546788737578212) internal successors, (45849), 43472 states have internal predecessors, (45849), 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-14 00:05:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43473 states to 43473 states and 45849 transitions. [2024-10-14 00:05:26,316 INFO L78 Accepts]: Start accepts. Automaton has 43473 states and 45849 transitions. Word has length 937 [2024-10-14 00:05:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:26,317 INFO L471 AbstractCegarLoop]: Abstraction has 43473 states and 45849 transitions. [2024-10-14 00:05:26,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-14 00:05:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 43473 states and 45849 transitions. [2024-10-14 00:05:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2024-10-14 00:05:26,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:26,443 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:05:26,460 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-14 00:05:26,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:05:26,649 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:26,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash 317429536, now seen corresponding path program 1 times [2024-10-14 00:05:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493458101] [2024-10-14 00:05:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 726 proven. 92 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-10-14 00:05:28,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:28,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493458101] [2024-10-14 00:05:28,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493458101] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 00:05:28,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655192095] [2024-10-14 00:05:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:28,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:05:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:05:28,117 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-14 00:05:28,119 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-14 00:05:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:28,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:05:28,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:05:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-14 00:05:28,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:05:28,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655192095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:28,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 00:05:28,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-14 00:05:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154569763] [2024-10-14 00:05:28,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:28,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:28,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 00:05:28,813 INFO L87 Difference]: Start difference. First operand 43473 states and 45849 transitions. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-14 00:05:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:30,933 INFO L93 Difference]: Finished difference Result 97295 states and 103205 transitions. [2024-10-14 00:05:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:30,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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 963 [2024-10-14 00:05:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:31,001 INFO L225 Difference]: With dead ends: 97295 [2024-10-14 00:05:31,001 INFO L226 Difference]: Without dead ends: 49683 [2024-10-14 00:05:31,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 00:05:31,024 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 337 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:31,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1051 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 00:05:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49683 states. [2024-10-14 00:05:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49683 to 47613. [2024-10-14 00:05:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47613 states, 47612 states have (on average 1.033016886499202) internal successors, (49184), 47612 states have internal predecessors, (49184), 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-14 00:05:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47613 states to 47613 states and 49184 transitions. [2024-10-14 00:05:31,649 INFO L78 Accepts]: Start accepts. Automaton has 47613 states and 49184 transitions. Word has length 963 [2024-10-14 00:05:31,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:31,649 INFO L471 AbstractCegarLoop]: Abstraction has 47613 states and 49184 transitions. [2024-10-14 00:05:31,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-14 00:05:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 47613 states and 49184 transitions. [2024-10-14 00:05:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2024-10-14 00:05:31,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:05:31,680 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:05:31,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 00:05:31,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 00:05:31,881 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:05:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:05:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -153115856, now seen corresponding path program 1 times [2024-10-14 00:05:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:05:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8352324] [2024-10-14 00:05:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:05:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:05:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:05:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2024-10-14 00:05:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:05:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8352324] [2024-10-14 00:05:32,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8352324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:05:32,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:05:32,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:05:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274846731] [2024-10-14 00:05:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:05:32,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:05:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:05:32,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:05:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:05:32,531 INFO L87 Difference]: Start difference. First operand 47613 states and 49184 transitions. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-14 00:05:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:05:34,432 INFO L93 Difference]: Finished difference Result 93843 states and 96948 transitions. [2024-10-14 00:05:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:05:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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 1009 [2024-10-14 00:05:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:05:34,433 INFO L225 Difference]: With dead ends: 93843 [2024-10-14 00:05:34,433 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 00:05:34,468 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-14 00:05:34,469 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 635 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 00:05:34,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 263 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 00:05:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 00:05:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 00:05:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:05:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 00:05:34,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1009 [2024-10-14 00:05:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:05:34,471 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 00:05:34,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-14 00:05:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 00:05:34,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 00:05:34,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:05:34,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 00:05:34,479 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:05:34,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 00:05:35,291 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:05:35,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:05:35 BoogieIcfgContainer [2024-10-14 00:05:35,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:05:35,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:05:35,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:05:35,313 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:05:35,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:04:38" (3/4) ... [2024-10-14 00:05:35,316 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 00:05:35,375 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 00:05:35,381 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 00:05:35,387 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 00:05:35,394 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 00:05:35,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 00:05:35,731 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 00:05:35,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:05:35,732 INFO L158 Benchmark]: Toolchain (without parser) took 63156.26ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 111.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 903.2MB. Max. memory is 16.1GB. [2024-10-14 00:05:35,733 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:05:35,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1596.43ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 111.2MB in the beginning and 163.3MB in the end (delta: -52.1MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2024-10-14 00:05:35,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 246.79ms. Allocated memory is still 260.0MB. Free memory was 163.3MB in the beginning and 120.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-14 00:05:35,734 INFO L158 Benchmark]: Boogie Preprocessor took 528.42ms. Allocated memory is still 260.0MB. Free memory was 120.3MB in the beginning and 153.1MB in the end (delta: -32.8MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-10-14 00:05:35,734 INFO L158 Benchmark]: RCFGBuilder took 3688.70ms. Allocated memory was 260.0MB in the beginning and 438.3MB in the end (delta: 178.3MB). Free memory was 153.1MB in the beginning and 116.1MB in the end (delta: 37.0MB). Peak memory consumption was 223.6MB. Max. memory is 16.1GB. [2024-10-14 00:05:35,735 INFO L158 Benchmark]: TraceAbstraction took 56667.60ms. Allocated memory was 438.3MB in the beginning and 2.1GB in the end (delta: 1.6GB). Free memory was 115.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 587.2MB. Max. memory is 16.1GB. [2024-10-14 00:05:35,735 INFO L158 Benchmark]: Witness Printer took 419.15ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-14 00:05:35,737 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1596.43ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 111.2MB in the beginning and 163.3MB in the end (delta: -52.1MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 246.79ms. Allocated memory is still 260.0MB. Free memory was 163.3MB in the beginning and 120.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 528.42ms. Allocated memory is still 260.0MB. Free memory was 120.3MB in the beginning and 153.1MB in the end (delta: -32.8MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3688.70ms. Allocated memory was 260.0MB in the beginning and 438.3MB in the end (delta: 178.3MB). Free memory was 153.1MB in the beginning and 116.1MB in the end (delta: 37.0MB). Peak memory consumption was 223.6MB. Max. memory is 16.1GB. * TraceAbstraction took 56667.60ms. Allocated memory was 438.3MB in the beginning and 2.1GB in the end (delta: 1.6GB). Free memory was 115.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 587.2MB. Max. memory is 16.1GB. * Witness Printer took 419.15ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 199]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 695 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.7s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9538 SdHoareTripleChecker+Valid, 31.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9538 mSDsluCounter, 12043 SdHoareTripleChecker+Invalid, 25.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 6050 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31538 IncrementalHoareTripleChecker+Invalid, 37588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6050 mSolverCounterUnsat, 11941 mSDtfsCounter, 31538 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3857 GetRequests, 3825 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47613occurred in iteration=15, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 5520 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 11971 NumberOfCodeBlocks, 11971 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11950 ConstructedInterpolants, 0 QuantifiedInterpolants, 27109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4490 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 10174/10488 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4269]: Loop Invariant Derived loop invariant: ((((((((a24 <= 0) || (3 <= a24)) || (a24 == 1)) || (a18 <= 8)) || (a15 != 4)) || (11 <= a18)) || (a18 == 9)) || (a3 <= 99)) RESULT: Ultimate proved your program to be correct! [2024-10-14 00:05:35,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE