./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/bitvector/byte_add_1-1.i -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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:31:15,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:31:15,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:31:15,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:31:15,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:31:15,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:31:15,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:31:15,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:31:15,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:31:15,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:31:15,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:31:15,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:31:15,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:31:15,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:31:15,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:31:15,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:31:15,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:31:15,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:31:15,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:31:15,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:31:15,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:31:15,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:31:15,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:31:15,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:31:15,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:31:15,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:31:15,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:31:15,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:31:15,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:31:15,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:31:15,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:31:15,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:31:15,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:15,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:31:15,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:31:15,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:31:15,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:31:15,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:31:15,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:31:15,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:31:15,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:31:15,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:31:15,423 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2024-11-18 09:31:15,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:31:15,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:31:15,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:31:15,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:31:15,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:31:15,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-18 09:31:17,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:31:17,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:31:17,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-18 09:31:17,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fa484fe/ed4e64d7ee6e4782b8d623b1c78852ae/FLAGdbd2bc122 [2024-11-18 09:31:17,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fa484fe/ed4e64d7ee6e4782b8d623b1c78852ae [2024-11-18 09:31:17,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:31:17,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:31:17,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:17,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:31:17,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:31:17,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1c8dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17, skipping insertion in model container [2024-11-18 09:31:17,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:31:17,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-18 09:31:17,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:17,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:31:17,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-18 09:31:17,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:17,841 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:31:17,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17 WrapperNode [2024-11-18 09:31:17,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:17,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:17,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:31:17,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:31:17,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,887 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2024-11-18 09:31:17,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:17,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:31:17,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:31:17,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:31:17,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,928 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 09:31:17,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:31:17,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:31:17,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:31:17,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:31:17,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (1/1) ... [2024-11-18 09:31:17,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:17,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:18,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 09:31:18,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 09:31:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:31:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:31:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:31:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:31:18,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:31:18,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:31:18,462 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-18 09:31:18,463 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:31:18,480 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:31:18,481 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 09:31:18,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:18 BoogieIcfgContainer [2024-11-18 09:31:18,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:31:18,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:31:18,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:31:18,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:31:18,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:31:17" (1/3) ... [2024-11-18 09:31:18,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c1fe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:18, skipping insertion in model container [2024-11-18 09:31:18,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:17" (2/3) ... [2024-11-18 09:31:18,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c1fe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:18, skipping insertion in model container [2024-11-18 09:31:18,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:18" (3/3) ... [2024-11-18 09:31:18,491 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-11-18 09:31:18,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:31:18,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:31:18,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:31:18,588 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;@a627439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:31:18,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:31:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 09:31:18,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:18,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:18,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:18,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1425856197, now seen corresponding path program 1 times [2024-11-18 09:31:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:18,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41782103] [2024-11-18 09:31:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:18,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41782103] [2024-11-18 09:31:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41782103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:18,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:18,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:31:18,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199228262] [2024-11-18 09:31:18,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:18,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:31:18,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:31:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:31:19,022 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-11-18 09:31:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:19,036 INFO L93 Difference]: Finished difference Result 75 states and 122 transitions. [2024-11-18 09:31:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:31:19,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-11-18 09:31:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:19,044 INFO L225 Difference]: With dead ends: 75 [2024-11-18 09:31:19,044 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 09:31:19,046 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-11-18 09:31:19,049 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:19,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 09:31:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-18 09:31:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 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-11-18 09:31:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2024-11-18 09:31:19,096 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 15 [2024-11-18 09:31:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:19,097 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2024-11-18 09:31:19,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-11-18 09:31:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2024-11-18 09:31:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 09:31:19,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:19,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:19,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:31:19,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:19,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:19,103 INFO L85 PathProgramCache]: Analyzing trace with hash -518266215, now seen corresponding path program 1 times [2024-11-18 09:31:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:19,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796965334] [2024-11-18 09:31:19,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796965334] [2024-11-18 09:31:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796965334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903092391] [2024-11-18 09:31:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:19,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:19,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:19,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:19,365 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-18 09:31:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:19,520 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2024-11-18 09:31:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:19,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-18 09:31:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:19,525 INFO L225 Difference]: With dead ends: 107 [2024-11-18 09:31:19,525 INFO L226 Difference]: Without dead ends: 70 [2024-11-18 09:31:19,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-18 09:31:19,526 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:19,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-18 09:31:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-18 09:31:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 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-11-18 09:31:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-11-18 09:31:19,542 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2024-11-18 09:31:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:19,543 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-11-18 09:31:19,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-18 09:31:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-11-18 09:31:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 09:31:19,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:19,544 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] [2024-11-18 09:31:19,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:31:19,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 458302340, now seen corresponding path program 1 times [2024-11-18 09:31:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433833504] [2024-11-18 09:31:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:19,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:19,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433833504] [2024-11-18 09:31:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433833504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:19,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:19,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920501206] [2024-11-18 09:31:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:19,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:19,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:19,746 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-11-18 09:31:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:20,035 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2024-11-18 09:31:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-18 09:31:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:20,037 INFO L225 Difference]: With dead ends: 164 [2024-11-18 09:31:20,037 INFO L226 Difference]: Without dead ends: 127 [2024-11-18 09:31:20,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-18 09:31:20,039 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:20,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:31:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-18 09:31:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2024-11-18 09:31:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-11-18 09:31:20,049 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2024-11-18 09:31:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:20,049 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-11-18 09:31:20,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-11-18 09:31:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-11-18 09:31:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 09:31:20,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:20,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:20,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:31:20,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:20,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 93424243, now seen corresponding path program 1 times [2024-11-18 09:31:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001267627] [2024-11-18 09:31:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 09:31:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001267627] [2024-11-18 09:31:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001267627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:20,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435077974] [2024-11-18 09:31:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:20,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:20,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:20,196 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-18 09:31:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:20,344 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2024-11-18 09:31:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:20,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 27 [2024-11-18 09:31:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:20,347 INFO L225 Difference]: With dead ends: 234 [2024-11-18 09:31:20,347 INFO L226 Difference]: Without dead ends: 156 [2024-11-18 09:31:20,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-18 09:31:20,349 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:20,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-18 09:31:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2024-11-18 09:31:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2024-11-18 09:31:20,367 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2024-11-18 09:31:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2024-11-18 09:31:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-18 09:31:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2024-11-18 09:31:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 09:31:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:20,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:20,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 09:31:20,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -302937854, now seen corresponding path program 1 times [2024-11-18 09:31:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934845400] [2024-11-18 09:31:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 09:31:20,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934845400] [2024-11-18 09:31:20,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934845400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:20,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:20,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039728088] [2024-11-18 09:31:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:20,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:20,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:20,515 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-18 09:31:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:20,658 INFO L93 Difference]: Finished difference Result 255 states and 380 transitions. [2024-11-18 09:31:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 28 [2024-11-18 09:31:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:20,660 INFO L225 Difference]: With dead ends: 255 [2024-11-18 09:31:20,660 INFO L226 Difference]: Without dead ends: 176 [2024-11-18 09:31:20,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-18 09:31:20,662 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:20,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-18 09:31:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2024-11-18 09:31:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 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-11-18 09:31:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-18 09:31:20,671 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2024-11-18 09:31:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:20,671 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-18 09:31:20,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-18 09:31:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-18 09:31:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 09:31:20,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:20,673 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 09:31:20,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:31:20,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:20,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:20,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1297586116, now seen corresponding path program 1 times [2024-11-18 09:31:20,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:20,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454664778] [2024-11-18 09:31:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:20,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:20,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454664778] [2024-11-18 09:31:20,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454664778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140855403] [2024-11-18 09:31:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:20,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:20,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:20,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 09:31:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:20,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:31:20,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:20,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140855403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:20,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:20,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-18 09:31:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889044179] [2024-11-18 09:31:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:20,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:20,968 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-18 09:31:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:21,172 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2024-11-18 09:31:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:21,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 29 [2024-11-18 09:31:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:21,178 INFO L225 Difference]: With dead ends: 230 [2024-11-18 09:31:21,178 INFO L226 Difference]: Without dead ends: 154 [2024-11-18 09:31:21,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:21,179 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:21,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-18 09:31:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2024-11-18 09:31:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 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-11-18 09:31:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-18 09:31:21,199 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 29 [2024-11-18 09:31:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-18 09:31:21,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-18 09:31:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-18 09:31:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 09:31:21,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:21,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:21,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 09:31:21,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 09:31:21,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:21,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1927695377, now seen corresponding path program 1 times [2024-11-18 09:31:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:21,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139623165] [2024-11-18 09:31:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:21,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139623165] [2024-11-18 09:31:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139623165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719058173] [2024-11-18 09:31:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:21,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:21,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:21,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 09:31:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:21,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:21,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 09:31:21,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719058173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:21,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:21,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-18 09:31:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69803944] [2024-11-18 09:31:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:21,708 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-18 09:31:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:21,881 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2024-11-18 09:31:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:21,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2024-11-18 09:31:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:21,883 INFO L225 Difference]: With dead ends: 288 [2024-11-18 09:31:21,883 INFO L226 Difference]: Without dead ends: 183 [2024-11-18 09:31:21,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:21,884 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:21,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-18 09:31:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2024-11-18 09:31:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 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-11-18 09:31:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-18 09:31:21,892 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 35 [2024-11-18 09:31:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:21,892 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-18 09:31:21,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-18 09:31:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-18 09:31:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 09:31:21,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:21,894 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:21,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 09:31:22,098 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,SelfDestructingSolverStorable6 [2024-11-18 09:31:22,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -977713378, now seen corresponding path program 1 times [2024-11-18 09:31:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619581257] [2024-11-18 09:31:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-18 09:31:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619581257] [2024-11-18 09:31:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619581257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:22,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581997167] [2024-11-18 09:31:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:22,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:22,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:22,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:22,228 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-11-18 09:31:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:22,477 INFO L93 Difference]: Finished difference Result 516 states and 714 transitions. [2024-11-18 09:31:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:31:22,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 41 [2024-11-18 09:31:22,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:22,479 INFO L225 Difference]: With dead ends: 516 [2024-11-18 09:31:22,480 INFO L226 Difference]: Without dead ends: 385 [2024-11-18 09:31:22,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:22,481 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 152 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:22,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 307 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-18 09:31:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 161. [2024-11-18 09:31:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 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-11-18 09:31:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-18 09:31:22,491 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 41 [2024-11-18 09:31:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:22,491 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-18 09:31:22,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-11-18 09:31:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-18 09:31:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 09:31:22,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:22,493 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:22,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 09:31:22,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:22,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash 915767303, now seen corresponding path program 1 times [2024-11-18 09:31:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309074397] [2024-11-18 09:31:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-18 09:31:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309074397] [2024-11-18 09:31:22,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309074397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:22,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:22,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006969834] [2024-11-18 09:31:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:22,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:22,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:22,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:22,666 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-18 09:31:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:22,675 INFO L93 Difference]: Finished difference Result 305 states and 420 transitions. [2024-11-18 09:31:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 42 [2024-11-18 09:31:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:22,677 INFO L225 Difference]: With dead ends: 305 [2024-11-18 09:31:22,677 INFO L226 Difference]: Without dead ends: 147 [2024-11-18 09:31:22,677 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-11-18 09:31:22,678 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 69 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:22,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-18 09:31:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-18 09:31:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.36986301369863) internal successors, (200), 146 states have internal predecessors, (200), 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-11-18 09:31:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2024-11-18 09:31:22,690 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 42 [2024-11-18 09:31:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:22,690 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2024-11-18 09:31:22,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-18 09:31:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2024-11-18 09:31:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 09:31:22,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:22,695 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:22,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 09:31:22,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:22,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1601810200, now seen corresponding path program 1 times [2024-11-18 09:31:22,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:22,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032846229] [2024-11-18 09:31:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032846229] [2024-11-18 09:31:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032846229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:22,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:22,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782607597] [2024-11-18 09:31:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:22,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:22,777 INFO L87 Difference]: Start difference. First operand 147 states and 200 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-18 09:31:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:22,790 INFO L93 Difference]: Finished difference Result 218 states and 293 transitions. [2024-11-18 09:31:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:22,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 47 [2024-11-18 09:31:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:22,792 INFO L225 Difference]: With dead ends: 218 [2024-11-18 09:31:22,792 INFO L226 Difference]: Without dead ends: 177 [2024-11-18 09:31:22,792 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-11-18 09:31:22,793 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:22,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-18 09:31:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-18 09:31:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 176 states have internal predecessors, (236), 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-11-18 09:31:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2024-11-18 09:31:22,800 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 47 [2024-11-18 09:31:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:22,801 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2024-11-18 09:31:22,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-18 09:31:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2024-11-18 09:31:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 09:31:22,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:22,802 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:22,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 09:31:22,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:22,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1529423642, now seen corresponding path program 1 times [2024-11-18 09:31:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293278816] [2024-11-18 09:31:22,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 09:31:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293278816] [2024-11-18 09:31:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293278816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288775283] [2024-11-18 09:31:22,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:22,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:22,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:22,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 09:31:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:23,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:31:23,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:23,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288775283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:23,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:23,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-18 09:31:23,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176455838] [2024-11-18 09:31:23,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:23,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:23,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:23,053 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-11-18 09:31:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:23,129 INFO L93 Difference]: Finished difference Result 364 states and 492 transitions. [2024-11-18 09:31:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:23,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 47 [2024-11-18 09:31:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:23,131 INFO L225 Difference]: With dead ends: 364 [2024-11-18 09:31:23,131 INFO L226 Difference]: Without dead ends: 171 [2024-11-18 09:31:23,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:23,132 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:23,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-18 09:31:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2024-11-18 09:31:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3049645390070923) internal successors, (184), 141 states have internal predecessors, (184), 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-11-18 09:31:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2024-11-18 09:31:23,138 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 47 [2024-11-18 09:31:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:23,138 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2024-11-18 09:31:23,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-11-18 09:31:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2024-11-18 09:31:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 09:31:23,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:23,139 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:23,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 09:31:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:23,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:23,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash -646401574, now seen corresponding path program 1 times [2024-11-18 09:31:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:23,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024893849] [2024-11-18 09:31:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 09:31:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024893849] [2024-11-18 09:31:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024893849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:23,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:23,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388752943] [2024-11-18 09:31:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:23,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:23,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:23,643 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-11-18 09:31:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:23,969 INFO L93 Difference]: Finished difference Result 509 states and 661 transitions. [2024-11-18 09:31:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:31:23,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 68 [2024-11-18 09:31:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:23,975 INFO L225 Difference]: With dead ends: 509 [2024-11-18 09:31:23,975 INFO L226 Difference]: Without dead ends: 386 [2024-11-18 09:31:23,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:23,976 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 125 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:23,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 229 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:31:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-18 09:31:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 142. [2024-11-18 09:31:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3049645390070923) internal successors, (184), 141 states have internal predecessors, (184), 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-11-18 09:31:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2024-11-18 09:31:23,991 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 68 [2024-11-18 09:31:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:23,991 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2024-11-18 09:31:23,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-11-18 09:31:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2024-11-18 09:31:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 09:31:23,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:23,992 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:23,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 09:31:23,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:23,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1338944162, now seen corresponding path program 1 times [2024-11-18 09:31:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32862251] [2024-11-18 09:31:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-18 09:31:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32862251] [2024-11-18 09:31:24,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32862251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:24,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:24,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:24,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863669681] [2024-11-18 09:31:24,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:24,419 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-18 09:31:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:24,571 INFO L93 Difference]: Finished difference Result 434 states and 570 transitions. [2024-11-18 09:31:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:31:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 69 [2024-11-18 09:31:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:24,573 INFO L225 Difference]: With dead ends: 434 [2024-11-18 09:31:24,574 INFO L226 Difference]: Without dead ends: 311 [2024-11-18 09:31:24,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:24,575 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 155 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:24,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 211 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-18 09:31:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 221. [2024-11-18 09:31:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 220 states have internal predecessors, (287), 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-11-18 09:31:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2024-11-18 09:31:24,586 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 69 [2024-11-18 09:31:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:24,586 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2024-11-18 09:31:24,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-18 09:31:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2024-11-18 09:31:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 09:31:24,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:24,587 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:24,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 09:31:24,588 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:24,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2129136800, now seen corresponding path program 1 times [2024-11-18 09:31:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:24,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201067669] [2024-11-18 09:31:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 09:31:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201067669] [2024-11-18 09:31:24,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201067669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:24,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:24,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:31:24,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258594068] [2024-11-18 09:31:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:24,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:31:24,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:24,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:31:24,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:24,760 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-11-18 09:31:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:25,384 INFO L93 Difference]: Finished difference Result 1045 states and 1352 transitions. [2024-11-18 09:31:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:31:25,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 69 [2024-11-18 09:31:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:25,387 INFO L225 Difference]: With dead ends: 1045 [2024-11-18 09:31:25,387 INFO L226 Difference]: Without dead ends: 843 [2024-11-18 09:31:25,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:31:25,388 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 188 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:25,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 349 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 09:31:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-18 09:31:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 221. [2024-11-18 09:31:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 220 states have internal predecessors, (287), 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-11-18 09:31:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2024-11-18 09:31:25,397 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 69 [2024-11-18 09:31:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:25,398 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2024-11-18 09:31:25,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-11-18 09:31:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2024-11-18 09:31:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 09:31:25,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:25,398 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 09:31:25,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:25,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1748433890, now seen corresponding path program 1 times [2024-11-18 09:31:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:25,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169811815] [2024-11-18 09:31:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-18 09:31:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169811815] [2024-11-18 09:31:25,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169811815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:25,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951699877] [2024-11-18 09:31:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:25,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:25,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:25,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 09:31:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:25,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 09:31:25,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 09:31:25,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951699877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:25,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:25,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-18 09:31:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448155338] [2024-11-18 09:31:25,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:31:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:25,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:31:25,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-18 09:31:25,965 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-11-18 09:31:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:26,185 INFO L93 Difference]: Finished difference Result 988 states and 1284 transitions. [2024-11-18 09:31:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:31:26,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 69 [2024-11-18 09:31:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:26,188 INFO L225 Difference]: With dead ends: 988 [2024-11-18 09:31:26,188 INFO L226 Difference]: Without dead ends: 781 [2024-11-18 09:31:26,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-18 09:31:26,189 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 135 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:26,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 559 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2024-11-18 09:31:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 372. [2024-11-18 09:31:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.280323450134771) internal successors, (475), 371 states have internal predecessors, (475), 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-11-18 09:31:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 475 transitions. [2024-11-18 09:31:26,208 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 475 transitions. Word has length 69 [2024-11-18 09:31:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:26,208 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 475 transitions. [2024-11-18 09:31:26,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-11-18 09:31:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 475 transitions. [2024-11-18 09:31:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-18 09:31:26,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:26,210 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:26,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 09:31:26,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 09:31:26,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:26,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:26,411 INFO L85 PathProgramCache]: Analyzing trace with hash 97611583, now seen corresponding path program 1 times [2024-11-18 09:31:26,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:26,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003302436] [2024-11-18 09:31:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-18 09:31:26,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003302436] [2024-11-18 09:31:26,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003302436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898027394] [2024-11-18 09:31:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:26,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:26,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:26,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 09:31:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:26,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:31:26,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-18 09:31:26,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898027394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:26,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:26,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-18 09:31:26,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803536992] [2024-11-18 09:31:26,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:26,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:26,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:26,744 INFO L87 Difference]: Start difference. First operand 372 states and 475 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-11-18 09:31:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:26,863 INFO L93 Difference]: Finished difference Result 785 states and 1011 transitions. [2024-11-18 09:31:26,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:26,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 71 [2024-11-18 09:31:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:26,866 INFO L225 Difference]: With dead ends: 785 [2024-11-18 09:31:26,866 INFO L226 Difference]: Without dead ends: 583 [2024-11-18 09:31:26,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:26,867 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:26,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 130 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-18 09:31:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 559. [2024-11-18 09:31:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2849462365591398) internal successors, (717), 558 states have internal predecessors, (717), 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-11-18 09:31:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 717 transitions. [2024-11-18 09:31:26,893 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 717 transitions. Word has length 71 [2024-11-18 09:31:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:26,893 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 717 transitions. [2024-11-18 09:31:26,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-11-18 09:31:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 717 transitions. [2024-11-18 09:31:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-18 09:31:26,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:26,895 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:26,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 09:31:27,097 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,SelfDestructingSolverStorable15 [2024-11-18 09:31:27,097 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:27,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash -59174066, now seen corresponding path program 1 times [2024-11-18 09:31:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369836850] [2024-11-18 09:31:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-18 09:31:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369836850] [2024-11-18 09:31:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369836850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004473649] [2024-11-18 09:31:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:27,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:27,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 09:31:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:27,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 09:31:27,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-18 09:31:27,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:31:27,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004473649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:27,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:27,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2024-11-18 09:31:27,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556867229] [2024-11-18 09:31:27,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:27,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 09:31:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:27,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 09:31:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:31:27,694 INFO L87 Difference]: Start difference. First operand 559 states and 717 transitions. Second operand has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 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-11-18 09:31:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:28,949 INFO L93 Difference]: Finished difference Result 2505 states and 3415 transitions. [2024-11-18 09:31:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-18 09:31:28,949 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 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 72 [2024-11-18 09:31:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:28,954 INFO L225 Difference]: With dead ends: 2505 [2024-11-18 09:31:28,954 INFO L226 Difference]: Without dead ends: 1879 [2024-11-18 09:31:28,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=586, Invalid=1220, Unknown=0, NotChecked=0, Total=1806 [2024-11-18 09:31:28,955 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 759 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:28,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 340 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 09:31:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2024-11-18 09:31:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1578. [2024-11-18 09:31:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.3595434369055168) internal successors, (2144), 1577 states have internal predecessors, (2144), 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-11-18 09:31:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2144 transitions. [2024-11-18 09:31:29,008 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2144 transitions. Word has length 72 [2024-11-18 09:31:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:29,008 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2144 transitions. [2024-11-18 09:31:29,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 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-11-18 09:31:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2144 transitions. [2024-11-18 09:31:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 09:31:29,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:29,009 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:29,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 09:31:29,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 09:31:29,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash 982675604, now seen corresponding path program 1 times [2024-11-18 09:31:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:29,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070133191] [2024-11-18 09:31:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:29,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070133191] [2024-11-18 09:31:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070133191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976316121] [2024-11-18 09:31:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:29,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:29,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:29,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 09:31:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:30,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 09:31:30,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:30,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976316121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:30,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:30,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-18 09:31:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769611974] [2024-11-18 09:31:30,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:30,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 09:31:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 09:31:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:31:30,737 INFO L87 Difference]: Start difference. First operand 1578 states and 2144 transitions. Second operand has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:31,055 INFO L93 Difference]: Finished difference Result 3353 states and 4481 transitions. [2024-11-18 09:31:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:31:31,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-18 09:31:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:31,062 INFO L225 Difference]: With dead ends: 3353 [2024-11-18 09:31:31,062 INFO L226 Difference]: Without dead ends: 1798 [2024-11-18 09:31:31,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2024-11-18 09:31:31,065 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 275 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:31,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 532 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-11-18 09:31:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1258. [2024-11-18 09:31:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.3540175019888623) internal successors, (1702), 1257 states have internal predecessors, (1702), 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-11-18 09:31:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1702 transitions. [2024-11-18 09:31:31,160 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1702 transitions. Word has length 73 [2024-11-18 09:31:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:31,161 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1702 transitions. [2024-11-18 09:31:31,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1702 transitions. [2024-11-18 09:31:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 09:31:31,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:31,162 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:31,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 09:31:31,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:31,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:31,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash 896849236, now seen corresponding path program 2 times [2024-11-18 09:31:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:31,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596176040] [2024-11-18 09:31:31,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:31,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:31,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 09:31:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596176040] [2024-11-18 09:31:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596176040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431367040] [2024-11-18 09:31:31,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:31,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:31,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:31,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:31,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 09:31:31,959 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:31,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:31,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 09:31:31,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:32,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431367040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:32,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:32,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-18 09:31:32,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612096006] [2024-11-18 09:31:32,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:32,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 09:31:32,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 09:31:32,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-18 09:31:32,764 INFO L87 Difference]: Start difference. First operand 1258 states and 1702 transitions. Second operand has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 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-11-18 09:31:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:34,659 INFO L93 Difference]: Finished difference Result 5296 states and 6870 transitions. [2024-11-18 09:31:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-18 09:31:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 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 73 [2024-11-18 09:31:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:34,675 INFO L225 Difference]: With dead ends: 5296 [2024-11-18 09:31:34,676 INFO L226 Difference]: Without dead ends: 5285 [2024-11-18 09:31:34,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=2060, Unknown=0, NotChecked=0, Total=2550 [2024-11-18 09:31:34,678 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 317 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:34,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 2018 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 09:31:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2024-11-18 09:31:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 2218. [2024-11-18 09:31:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 1.395128552097429) internal successors, (3093), 2217 states have internal predecessors, (3093), 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-11-18 09:31:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3093 transitions. [2024-11-18 09:31:34,865 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3093 transitions. Word has length 73 [2024-11-18 09:31:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:34,866 INFO L471 AbstractCegarLoop]: Abstraction has 2218 states and 3093 transitions. [2024-11-18 09:31:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 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-11-18 09:31:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3093 transitions. [2024-11-18 09:31:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 09:31:34,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:34,868 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:34,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 09:31:35,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:35,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:35,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1772868242, now seen corresponding path program 1 times [2024-11-18 09:31:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:35,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011314413] [2024-11-18 09:31:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 09:31:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011314413] [2024-11-18 09:31:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011314413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779150391] [2024-11-18 09:31:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:35,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:35,475 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:35,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 09:31:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:35,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 09:31:35,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 09:31:35,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 09:31:36,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779150391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:36,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:36,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-18 09:31:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417592179] [2024-11-18 09:31:36,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:36,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 09:31:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 09:31:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-18 09:31:36,158 INFO L87 Difference]: Start difference. First operand 2218 states and 3093 transitions. Second operand has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 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-11-18 09:31:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:38,924 INFO L93 Difference]: Finished difference Result 6088 states and 8119 transitions. [2024-11-18 09:31:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-18 09:31:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 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 73 [2024-11-18 09:31:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:38,941 INFO L225 Difference]: With dead ends: 6088 [2024-11-18 09:31:38,941 INFO L226 Difference]: Without dead ends: 6077 [2024-11-18 09:31:38,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1168, Invalid=5474, Unknown=0, NotChecked=0, Total=6642 [2024-11-18 09:31:38,945 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 551 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:38,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 2596 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 09:31:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6077 states. [2024-11-18 09:31:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6077 to 3182. [2024-11-18 09:31:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.437912606098711) internal successors, (4574), 3181 states have internal predecessors, (4574), 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-11-18 09:31:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4574 transitions. [2024-11-18 09:31:39,235 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4574 transitions. Word has length 73 [2024-11-18 09:31:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:39,235 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4574 transitions. [2024-11-18 09:31:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 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-11-18 09:31:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4574 transitions. [2024-11-18 09:31:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-18 09:31:39,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:39,240 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:39,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 09:31:39,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:39,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:39,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1514721809, now seen corresponding path program 1 times [2024-11-18 09:31:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:39,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861499334] [2024-11-18 09:31:39,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:39,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:31:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861499334] [2024-11-18 09:31:40,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861499334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512227439] [2024-11-18 09:31:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:40,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:40,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:40,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:40,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 09:31:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:40,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 09:31:40,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 09:31:40,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-18 09:31:40,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512227439] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:40,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:40,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 9] total 22 [2024-11-18 09:31:40,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826559062] [2024-11-18 09:31:40,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:40,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:40,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-18 09:31:40,826 INFO L87 Difference]: Start difference. First operand 3182 states and 4574 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-18 09:31:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:40,968 INFO L93 Difference]: Finished difference Result 3190 states and 4583 transitions. [2024-11-18 09:31:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 75 [2024-11-18 09:31:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:40,976 INFO L225 Difference]: With dead ends: 3190 [2024-11-18 09:31:40,976 INFO L226 Difference]: Without dead ends: 3185 [2024-11-18 09:31:40,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-18 09:31:40,977 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:40,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2024-11-18 09:31:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3182. [2024-11-18 09:31:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.437912606098711) internal successors, (4574), 3181 states have internal predecessors, (4574), 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-11-18 09:31:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4574 transitions. [2024-11-18 09:31:41,094 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4574 transitions. Word has length 75 [2024-11-18 09:31:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:41,094 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4574 transitions. [2024-11-18 09:31:41,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-18 09:31:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4574 transitions. [2024-11-18 09:31:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 09:31:41,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:41,097 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:41,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 09:31:41,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-18 09:31:41,302 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:41,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -235685784, now seen corresponding path program 1 times [2024-11-18 09:31:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:41,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254552204] [2024-11-18 09:31:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:41,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:41,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254552204] [2024-11-18 09:31:41,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254552204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:41,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977246602] [2024-11-18 09:31:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:41,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:41,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:41,478 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:41,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 09:31:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:43,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 09:31:43,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:43,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977246602] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:43,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-18 09:31:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835832883] [2024-11-18 09:31:43,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 09:31:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 09:31:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:31:43,626 INFO L87 Difference]: Start difference. First operand 3182 states and 4574 transitions. Second operand has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 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-11-18 09:31:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:44,986 INFO L93 Difference]: Finished difference Result 9357 states and 12563 transitions. [2024-11-18 09:31:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-18 09:31:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 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 76 [2024-11-18 09:31:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:45,022 INFO L225 Difference]: With dead ends: 9357 [2024-11-18 09:31:45,024 INFO L226 Difference]: Without dead ends: 9352 [2024-11-18 09:31:45,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=457, Invalid=1349, Unknown=0, NotChecked=0, Total=1806 [2024-11-18 09:31:45,028 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 429 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:45,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1255 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 09:31:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9352 states. [2024-11-18 09:31:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9352 to 3616. [2024-11-18 09:31:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 3615 states have (on average 1.4533886583679114) internal successors, (5254), 3615 states have internal predecessors, (5254), 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-11-18 09:31:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 5254 transitions. [2024-11-18 09:31:45,370 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 5254 transitions. Word has length 76 [2024-11-18 09:31:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:45,370 INFO L471 AbstractCegarLoop]: Abstraction has 3616 states and 5254 transitions. [2024-11-18 09:31:45,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 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-11-18 09:31:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 5254 transitions. [2024-11-18 09:31:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-18 09:31:45,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:45,373 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:45,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:45,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-18 09:31:45,574 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1339024244, now seen corresponding path program 1 times [2024-11-18 09:31:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788965512] [2024-11-18 09:31:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:31:45,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:31:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:31:45,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 09:31:45,649 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:31:45,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:31:45,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-18 09:31:45,656 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:45,717 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:31:45,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:31:45 BoogieIcfgContainer [2024-11-18 09:31:45,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:31:45,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:31:45,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:31:45,724 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:31:45,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:18" (3/4) ... [2024-11-18 09:31:45,727 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 09:31:45,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:31:45,731 INFO L158 Benchmark]: Toolchain (without parser) took 28202.76ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 100.8MB in the beginning and 426.2MB in the end (delta: -325.4MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2024-11-18 09:31:45,731 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:31:45,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.28ms. Allocated memory is still 172.0MB. Free memory was 100.6MB in the beginning and 85.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 09:31:45,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.96ms. Allocated memory is still 172.0MB. Free memory was 85.8MB in the beginning and 82.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 09:31:45,732 INFO L158 Benchmark]: Boogie Preprocessor took 58.87ms. Allocated memory is still 172.0MB. Free memory was 82.6MB in the beginning and 79.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:31:45,732 INFO L158 Benchmark]: RCFGBuilder took 533.49ms. Allocated memory is still 172.0MB. Free memory was 79.6MB in the beginning and 123.8MB in the end (delta: -44.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-18 09:31:45,733 INFO L158 Benchmark]: TraceAbstraction took 27240.05ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 122.7MB in the beginning and 426.2MB in the end (delta: -303.5MB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. [2024-11-18 09:31:45,733 INFO L158 Benchmark]: Witness Printer took 6.58ms. Allocated memory is still 616.6MB. Free memory is still 426.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:31:45,734 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.11ms. Allocated memory is still 172.0MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.28ms. Allocated memory is still 172.0MB. Free memory was 100.6MB in the beginning and 85.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.96ms. Allocated memory is still 172.0MB. Free memory was 85.8MB in the beginning and 82.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.87ms. Allocated memory is still 172.0MB. Free memory was 82.6MB in the beginning and 79.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 533.49ms. Allocated memory is still 172.0MB. Free memory was 79.6MB in the beginning and 123.8MB in the end (delta: -44.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27240.05ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 122.7MB in the beginning and 426.2MB in the end (delta: -303.5MB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. * Witness Printer took 6.58ms. Allocated memory is still 616.6MB. Free memory is still 426.2MB. There was no memory consumed. 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 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=218103808, a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3561 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3561 mSDsluCounter, 9964 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7872 mSDsCounter, 378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6881 IncrementalHoareTripleChecker+Invalid, 7259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 378 mSolverCounterUnsat, 2092 mSDtfsCounter, 6881 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 1126 SyntacticMatches, 3 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3367 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3616occurred in iteration=22, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 14384 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1905 NumberOfCodeBlocks, 1905 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2231 ConstructedInterpolants, 0 QuantifiedInterpolants, 12160 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1952 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 1524/2271 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 09:31:45,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:31:47,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:31:48,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 09:31:48,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:31:48,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:31:48,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:31:48,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:31:48,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:31:48,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:31:48,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:31:48,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:31:48,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:31:48,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:31:48,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:31:48,059 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:31:48,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:31:48,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:31:48,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:31:48,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:31:48,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:31:48,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:31:48,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:31:48,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:31:48,066 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 09:31:48,066 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 09:31:48,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:31:48,066 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 09:31:48,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:31:48,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:31:48,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:31:48,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:31:48,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:31:48,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:31:48,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:31:48,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:48,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:31:48,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:31:48,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:31:48,071 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 09:31:48,071 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 09:31:48,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:31:48,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:31:48,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:31:48,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:31:48,072 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2024-11-18 09:31:48,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:31:48,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:31:48,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:31:48,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:31:48,407 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:31:48,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-18 09:31:49,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:31:50,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:31:50,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-18 09:31:50,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b255504e/56a4c39c27c6484bb4df95f1bb9ce5ac/FLAG4184deb99 [2024-11-18 09:31:50,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b255504e/56a4c39c27c6484bb4df95f1bb9ce5ac [2024-11-18 09:31:50,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:31:50,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:31:50,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:50,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:31:50,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:31:50,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d93eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50, skipping insertion in model container [2024-11-18 09:31:50,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:31:50,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-18 09:31:50,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:50,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:31:50,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-18 09:31:50,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:50,572 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:31:50,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50 WrapperNode [2024-11-18 09:31:50,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:50,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:50,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:31:50,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:31:50,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,614 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-11-18 09:31:50,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:50,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:31:50,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:31:50,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:31:50,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,646 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 09:31:50,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:31:50,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:31:50,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:31:50,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:31:50,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (1/1) ... [2024-11-18 09:31:50,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:50,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 09:31:50,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 09:31:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:31:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 09:31:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:31:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:31:50,810 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:31:50,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:31:51,064 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-18 09:31:51,065 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:31:51,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:31:51,077 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 09:31:51,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:51 BoogieIcfgContainer [2024-11-18 09:31:51,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:31:51,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:31:51,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:31:51,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:31:51,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:31:50" (1/3) ... [2024-11-18 09:31:51,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd286df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:51, skipping insertion in model container [2024-11-18 09:31:51,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:50" (2/3) ... [2024-11-18 09:31:51,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd286df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:51, skipping insertion in model container [2024-11-18 09:31:51,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:51" (3/3) ... [2024-11-18 09:31:51,089 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-11-18 09:31:51,102 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:31:51,102 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:31:51,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:31:51,161 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;@78866a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:31:51,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:31:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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-11-18 09:31:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 09:31:51,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:51,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:51,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:51,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-18 09:31:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:51,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53504473] [2024-11-18 09:31:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:51,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:51,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:51,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 09:31:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:51,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 09:31:51,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:51,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:51,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53504473] [2024-11-18 09:31:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53504473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:51,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:51,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:31:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392351437] [2024-11-18 09:31:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:51,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:31:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:31:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:31:51,298 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-18 09:31:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:51,312 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-18 09:31:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:31:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-11-18 09:31:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:51,321 INFO L225 Difference]: With dead ends: 57 [2024-11-18 09:31:51,321 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 09:31:51,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11-18 09:31:51,325 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:51,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 09:31:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-18 09:31:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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-11-18 09:31:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-18 09:31:51,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-18 09:31:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:51,349 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-18 09:31:51,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-18 09:31:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-18 09:31:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 09:31:51,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:51,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:51,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 09:31:51,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-18 09:31:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750942435] [2024-11-18 09:31:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:51,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:51,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 09:31:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:51,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:31:51,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:51,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:51,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:51,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750942435] [2024-11-18 09:31:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750942435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:51,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948674892] [2024-11-18 09:31:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:51,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:51,641 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-18 09:31:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:51,746 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2024-11-18 09:31:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:51,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-18 09:31:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:51,747 INFO L225 Difference]: With dead ends: 101 [2024-11-18 09:31:51,747 INFO L226 Difference]: Without dead ends: 73 [2024-11-18 09:31:51,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-11-18 09:31:51,748 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 69 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:51,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-18 09:31:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-18 09:31:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 71 states have internal predecessors, (116), 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-11-18 09:31:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2024-11-18 09:31:51,757 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 12 [2024-11-18 09:31:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:51,758 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2024-11-18 09:31:51,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-18 09:31:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2024-11-18 09:31:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 09:31:51,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:51,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:51,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 09:31:51,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:51,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2024-11-18 09:31:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709207955] [2024-11-18 09:31:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:51,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:51,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:51,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 09:31:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:52,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:31:52,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:52,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:52,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709207955] [2024-11-18 09:31:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709207955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:52,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195456309] [2024-11-18 09:31:52,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:52,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:52,077 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-11-18 09:31:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:52,315 INFO L93 Difference]: Finished difference Result 135 states and 231 transitions. [2024-11-18 09:31:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:52,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-18 09:31:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:52,317 INFO L225 Difference]: With dead ends: 135 [2024-11-18 09:31:52,317 INFO L226 Difference]: Without dead ends: 107 [2024-11-18 09:31:52,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-18 09:31:52,319 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 82 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:52,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 242 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-18 09:31:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 72. [2024-11-18 09:31:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 71 states have internal predecessors, (116), 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-11-18 09:31:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2024-11-18 09:31:52,329 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 13 [2024-11-18 09:31:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:52,329 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2024-11-18 09:31:52,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-11-18 09:31:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2024-11-18 09:31:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 09:31:52,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:52,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:52,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 09:31:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:52,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:52,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2024-11-18 09:31:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661048082] [2024-11-18 09:31:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:52,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:52,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:52,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 09:31:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:52,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:52,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:52,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:52,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661048082] [2024-11-18 09:31:52,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661048082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:52,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:52,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:31:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876786657] [2024-11-18 09:31:52,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:31:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:31:52,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:52,601 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-11-18 09:31:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:52,822 INFO L93 Difference]: Finished difference Result 169 states and 283 transitions. [2024-11-18 09:31:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:31:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2024-11-18 09:31:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:52,824 INFO L225 Difference]: With dead ends: 169 [2024-11-18 09:31:52,824 INFO L226 Difference]: Without dead ends: 141 [2024-11-18 09:31:52,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:52,825 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 116 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:52,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 420 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-18 09:31:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 72. [2024-11-18 09:31:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 71 states have internal predecessors, (116), 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-11-18 09:31:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2024-11-18 09:31:52,833 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 14 [2024-11-18 09:31:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:52,833 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2024-11-18 09:31:52,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-11-18 09:31:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2024-11-18 09:31:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 09:31:52,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:52,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:52,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 09:31:53,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:53,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1392919516, now seen corresponding path program 1 times [2024-11-18 09:31:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:53,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457295350] [2024-11-18 09:31:53,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:53,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:53,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:53,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 09:31:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:53,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:31:53,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:53,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:53,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457295350] [2024-11-18 09:31:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457295350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:53,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 09:31:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327760833] [2024-11-18 09:31:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:31:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:31:53,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:53,146 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-11-18 09:31:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:53,325 INFO L93 Difference]: Finished difference Result 181 states and 293 transitions. [2024-11-18 09:31:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:31:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 14 [2024-11-18 09:31:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:53,327 INFO L225 Difference]: With dead ends: 181 [2024-11-18 09:31:53,327 INFO L226 Difference]: Without dead ends: 153 [2024-11-18 09:31:53,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:53,328 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 163 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:53,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 526 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-18 09:31:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2024-11-18 09:31:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 83 states have internal predecessors, (126), 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-11-18 09:31:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-18 09:31:53,336 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 14 [2024-11-18 09:31:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:53,336 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-18 09:31:53,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-11-18 09:31:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-18 09:31:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 09:31:53,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:53,337 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] [2024-11-18 09:31:53,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:53,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:53,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2024-11-18 09:31:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803542052] [2024-11-18 09:31:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:53,542 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:53,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-18 09:31:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:53,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:31:53,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:53,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:53,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:53,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803542052] [2024-11-18 09:31:53,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803542052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:53,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:53,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:53,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88106360] [2024-11-18 09:31:53,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:53,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:53,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:53,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:53,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:53,608 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-18 09:31:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:53,716 INFO L93 Difference]: Finished difference Result 222 states and 333 transitions. [2024-11-18 09:31:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-11-18 09:31:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:53,717 INFO L225 Difference]: With dead ends: 222 [2024-11-18 09:31:53,717 INFO L226 Difference]: Without dead ends: 155 [2024-11-18 09:31:53,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-11-18 09:31:53,718 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:53,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 144 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-18 09:31:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2024-11-18 09:31:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2024-11-18 09:31:53,725 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 25 [2024-11-18 09:31:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:53,725 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2024-11-18 09:31:53,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-18 09:31:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2024-11-18 09:31:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 09:31:53,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:53,726 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] [2024-11-18 09:31:53,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-18 09:31:53,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:53,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2024-11-18 09:31:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315352357] [2024-11-18 09:31:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:53,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:53,933 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:53,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-18 09:31:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:53,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:53,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 09:31:53,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:53,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:53,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315352357] [2024-11-18 09:31:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315352357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:53,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675285554] [2024-11-18 09:31:53,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:53,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:53,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:53,986 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11-18 09:31:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:54,009 INFO L93 Difference]: Finished difference Result 163 states and 242 transitions. [2024-11-18 09:31:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-11-18 09:31:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:54,010 INFO L225 Difference]: With dead ends: 163 [2024-11-18 09:31:54,010 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 09:31:54,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-11-18 09:31:54,011 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:54,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 09:31:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-18 09:31:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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-11-18 09:31:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2024-11-18 09:31:54,016 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 119 transitions. Word has length 26 [2024-11-18 09:31:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:54,016 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 119 transitions. [2024-11-18 09:31:54,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11-18 09:31:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-11-18 09:31:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 09:31:54,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:54,017 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] [2024-11-18 09:31:54,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-18 09:31:54,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:54,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2024-11-18 09:31:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074929501] [2024-11-18 09:31:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:54,222 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:54,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-18 09:31:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:54,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 09:31:54,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:54,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:54,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:54,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074929501] [2024-11-18 09:31:54,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074929501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:54,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562830173] [2024-11-18 09:31:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:54,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:54,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:54,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:54,306 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-18 09:31:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:54,320 INFO L93 Difference]: Finished difference Result 113 states and 164 transitions. [2024-11-18 09:31:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-11-18 09:31:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:54,322 INFO L225 Difference]: With dead ends: 113 [2024-11-18 09:31:54,322 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 09:31:54,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-11-18 09:31:54,323 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:54,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 09:31:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-18 09:31:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 101 states have internal predecessors, (147), 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-11-18 09:31:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2024-11-18 09:31:54,339 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 29 [2024-11-18 09:31:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2024-11-18 09:31:54,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-18 09:31:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2024-11-18 09:31:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 09:31:54,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:54,342 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] [2024-11-18 09:31:54,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:54,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:54,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2024-11-18 09:31:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871599473] [2024-11-18 09:31:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:54,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:54,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:54,552 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:54,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-18 09:31:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:54,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:31:54,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:54,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:54,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871599473] [2024-11-18 09:31:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871599473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:54,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746097803] [2024-11-18 09:31:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:54,729 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-18 09:31:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:54,892 INFO L93 Difference]: Finished difference Result 222 states and 333 transitions. [2024-11-18 09:31:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:54,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2024-11-18 09:31:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:54,894 INFO L225 Difference]: With dead ends: 222 [2024-11-18 09:31:54,894 INFO L226 Difference]: Without dead ends: 171 [2024-11-18 09:31:54,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-11-18 09:31:54,895 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:54,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 106 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-18 09:31:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2024-11-18 09:31:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4259259259259258) internal successors, (231), 162 states have internal predecessors, (231), 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-11-18 09:31:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2024-11-18 09:31:54,916 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 29 [2024-11-18 09:31:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:54,917 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2024-11-18 09:31:54,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-18 09:31:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2024-11-18 09:31:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 09:31:54,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:54,918 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] [2024-11-18 09:31:54,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-18 09:31:55,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:55,121 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1828261773, now seen corresponding path program 1 times [2024-11-18 09:31:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104974022] [2024-11-18 09:31:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:55,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:55,126 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:55,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-18 09:31:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:55,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:55,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:55,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:55,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104974022] [2024-11-18 09:31:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104974022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:31:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708372679] [2024-11-18 09:31:55,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:55,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:31:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:31:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:55,268 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-11-18 09:31:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:55,386 INFO L93 Difference]: Finished difference Result 283 states and 417 transitions. [2024-11-18 09:31:55,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:31:55,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 30 [2024-11-18 09:31:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:55,387 INFO L225 Difference]: With dead ends: 283 [2024-11-18 09:31:55,387 INFO L226 Difference]: Without dead ends: 232 [2024-11-18 09:31:55,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:55,388 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 96 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:55,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 173 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-18 09:31:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 163. [2024-11-18 09:31:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4259259259259258) internal successors, (231), 162 states have internal predecessors, (231), 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-11-18 09:31:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2024-11-18 09:31:55,394 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 30 [2024-11-18 09:31:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:55,394 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2024-11-18 09:31:55,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-11-18 09:31:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2024-11-18 09:31:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 09:31:55,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:55,395 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] [2024-11-18 09:31:55,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-18 09:31:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:55,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1502060971, now seen corresponding path program 1 times [2024-11-18 09:31:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365619255] [2024-11-18 09:31:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:55,612 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:55,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-18 09:31:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:55,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:31:55,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:55,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:55,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365619255] [2024-11-18 09:31:55,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365619255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:55,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:55,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-18 09:31:55,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288652863] [2024-11-18 09:31:55,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:55,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 09:31:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 09:31:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:31:55,824 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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-11-18 09:31:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:56,276 INFO L93 Difference]: Finished difference Result 440 states and 658 transitions. [2024-11-18 09:31:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 09:31:56,276 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 31 [2024-11-18 09:31:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:56,279 INFO L225 Difference]: With dead ends: 440 [2024-11-18 09:31:56,279 INFO L226 Difference]: Without dead ends: 332 [2024-11-18 09:31:56,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:31:56,280 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 615 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:56,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 224 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:31:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-18 09:31:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 283. [2024-11-18 09:31:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.450354609929078) internal successors, (409), 282 states have internal predecessors, (409), 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-11-18 09:31:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2024-11-18 09:31:56,302 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 31 [2024-11-18 09:31:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:56,303 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2024-11-18 09:31:56,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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-11-18 09:31:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2024-11-18 09:31:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 09:31:56,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:56,305 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] [2024-11-18 09:31:56,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-18 09:31:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:56,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1642609581, now seen corresponding path program 1 times [2024-11-18 09:31:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:56,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990441441] [2024-11-18 09:31:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:56,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:56,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:56,512 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:56,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-18 09:31:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:56,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:31:56,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:56,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:56,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990441441] [2024-11-18 09:31:56,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990441441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:56,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:56,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-18 09:31:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857969598] [2024-11-18 09:31:56,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:56,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 09:31:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 09:31:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:31:56,707 INFO L87 Difference]: Start difference. First operand 283 states and 409 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-11-18 09:31:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:56,888 INFO L93 Difference]: Finished difference Result 738 states and 1127 transitions. [2024-11-18 09:31:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:31:56,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 31 [2024-11-18 09:31:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:56,892 INFO L225 Difference]: With dead ends: 738 [2024-11-18 09:31:56,892 INFO L226 Difference]: Without dead ends: 477 [2024-11-18 09:31:56,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:31:56,893 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 190 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:56,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 92 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-18 09:31:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 396. [2024-11-18 09:31:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4936708860759493) internal successors, (590), 395 states have internal predecessors, (590), 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-11-18 09:31:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 590 transitions. [2024-11-18 09:31:56,914 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 590 transitions. Word has length 31 [2024-11-18 09:31:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:56,915 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 590 transitions. [2024-11-18 09:31:56,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-11-18 09:31:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 590 transitions. [2024-11-18 09:31:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:31:56,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:56,916 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:56,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-18 09:31:57,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:57,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:57,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1493994486, now seen corresponding path program 1 times [2024-11-18 09:31:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:57,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409110505] [2024-11-18 09:31:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:57,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:57,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:57,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-18 09:31:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:57,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:31:57,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:57,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:57,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409110505] [2024-11-18 09:31:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409110505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:57,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:57,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-18 09:31:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762545590] [2024-11-18 09:31:57,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:57,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 09:31:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:57,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 09:31:57,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:31:57,312 INFO L87 Difference]: Start difference. First operand 396 states and 590 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-11-18 09:31:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:57,529 INFO L93 Difference]: Finished difference Result 1213 states and 1778 transitions. [2024-11-18 09:31:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:31:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 70 [2024-11-18 09:31:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:57,532 INFO L225 Difference]: With dead ends: 1213 [2024-11-18 09:31:57,532 INFO L226 Difference]: Without dead ends: 840 [2024-11-18 09:31:57,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:31:57,533 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 274 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:57,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 327 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-18 09:31:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 559. [2024-11-18 09:31:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.5017921146953406) internal successors, (838), 558 states have internal predecessors, (838), 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-11-18 09:31:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 838 transitions. [2024-11-18 09:31:57,560 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 838 transitions. Word has length 70 [2024-11-18 09:31:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:57,561 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 838 transitions. [2024-11-18 09:31:57,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-11-18 09:31:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 838 transitions. [2024-11-18 09:31:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:31:57,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:57,562 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:57,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-18 09:31:57,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:57,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:57,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash 464635188, now seen corresponding path program 2 times [2024-11-18 09:31:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21380617] [2024-11-18 09:31:57,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:57,766 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:57,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-18 09:31:57,817 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:57,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:57,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:31:57,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 09:31:57,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 09:31:58,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21380617] [2024-11-18 09:31:58,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21380617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:58,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:58,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-11-18 09:31:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341691710] [2024-11-18 09:31:58,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:58,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 09:31:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:58,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 09:31:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:31:58,166 INFO L87 Difference]: Start difference. First operand 559 states and 838 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-11-18 09:31:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:58,482 INFO L93 Difference]: Finished difference Result 1370 states and 1973 transitions. [2024-11-18 09:31:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:31:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 70 [2024-11-18 09:31:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:58,486 INFO L225 Difference]: With dead ends: 1370 [2024-11-18 09:31:58,486 INFO L226 Difference]: Without dead ends: 834 [2024-11-18 09:31:58,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:31:58,488 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 228 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:58,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 358 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-18 09:31:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 500. [2024-11-18 09:31:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.4388777555110221) internal successors, (718), 499 states have internal predecessors, (718), 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-11-18 09:31:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 718 transitions. [2024-11-18 09:31:58,530 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 718 transitions. Word has length 70 [2024-11-18 09:31:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:58,531 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 718 transitions. [2024-11-18 09:31:58,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-11-18 09:31:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 718 transitions. [2024-11-18 09:31:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:31:58,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:58,532 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:58,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:58,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:58,735 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:58,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 3 times [2024-11-18 09:31:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63460755] [2024-11-18 09:31:58,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:31:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:58,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:58,740 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:58,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-18 09:31:58,782 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-18 09:31:58,782 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:58,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-18 09:31:58,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:01,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:03,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63460755] [2024-11-18 09:32:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63460755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:03,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:03,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2024-11-18 09:32:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342240772] [2024-11-18 09:32:03,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:03,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-18 09:32:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-18 09:32:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 09:32:03,835 INFO L87 Difference]: Start difference. First operand 500 states and 718 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:21,345 INFO L93 Difference]: Finished difference Result 1400 states and 1934 transitions. [2024-11-18 09:32:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-18 09:32:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-18 09:32:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:21,350 INFO L225 Difference]: With dead ends: 1400 [2024-11-18 09:32:21,351 INFO L226 Difference]: Without dead ends: 1312 [2024-11-18 09:32:21,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5089 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3344, Invalid=18412, Unknown=0, NotChecked=0, Total=21756 [2024-11-18 09:32:21,356 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 2304 mSDsluCounter, 7666 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2304 SdHoareTripleChecker+Valid, 8050 SdHoareTripleChecker+Invalid, 5230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:21,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2304 Valid, 8050 Invalid, 5230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-18 09:32:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-18 09:32:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 861. [2024-11-18 09:32:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.45) internal successors, (1247), 860 states have internal predecessors, (1247), 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-11-18 09:32:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1247 transitions. [2024-11-18 09:32:21,434 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1247 transitions. Word has length 70 [2024-11-18 09:32:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:21,435 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1247 transitions. [2024-11-18 09:32:21,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1247 transitions. [2024-11-18 09:32:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:32:21,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:21,437 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:21,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-18 09:32:21,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:21,639 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:21,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash 824038516, now seen corresponding path program 1 times [2024-11-18 09:32:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174645070] [2024-11-18 09:32:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:21,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:21,644 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:32:21,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-18 09:32:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:21,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:32:21,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:32:21,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:32:21,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174645070] [2024-11-18 09:32:21,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174645070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:21,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:21,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-18 09:32:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721312274] [2024-11-18 09:32:21,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:21,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:21,798 INFO L87 Difference]: Start difference. First operand 861 states and 1247 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-18 09:32:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:21,986 INFO L93 Difference]: Finished difference Result 1778 states and 2589 transitions. [2024-11-18 09:32:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 70 [2024-11-18 09:32:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:21,990 INFO L225 Difference]: With dead ends: 1778 [2024-11-18 09:32:21,990 INFO L226 Difference]: Without dead ends: 937 [2024-11-18 09:32:21,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:21,991 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:21,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-18 09:32:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 781. [2024-11-18 09:32:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.405128205128205) internal successors, (1096), 780 states have internal predecessors, (1096), 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-11-18 09:32:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1096 transitions. [2024-11-18 09:32:22,047 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1096 transitions. Word has length 70 [2024-11-18 09:32:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:22,047 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1096 transitions. [2024-11-18 09:32:22,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-18 09:32:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1096 transitions. [2024-11-18 09:32:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-18 09:32:22,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:22,049 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:22,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-18 09:32:22,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:22,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:22,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1235371034, now seen corresponding path program 1 times [2024-11-18 09:32:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:22,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091054769] [2024-11-18 09:32:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:22,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:22,255 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:32:22,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-18 09:32:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:22,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-18 09:32:22,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:25,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:28,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091054769] [2024-11-18 09:32:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091054769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:28,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-18 09:32:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453120231] [2024-11-18 09:32:28,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:28,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-18 09:32:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:28,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-18 09:32:28,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2024-11-18 09:32:28,362 INFO L87 Difference]: Start difference. First operand 781 states and 1096 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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)