/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:19:25,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:19:25,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 07:19:25,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:19:25,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:19:25,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:19:25,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:19:25,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:19:25,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:19:25,599 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:19:25,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:19:25,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:19:25,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:19:25,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:19:25,601 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:19:25,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:19:25,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:19:25,602 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:19:25,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:19:25,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:19:25,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:19:25,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:19:25,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:19:25,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:19:25,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:19:25,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:19:25,603 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:19:25,603 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:19:25,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:19:25,604 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:19:25,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:19:25,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:19:25,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:19:25,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:19:25,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:19:25,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:19:25,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:19:25,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:19:25,607 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:19:25,607 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 [2023-12-16 07:19:25,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:19:25,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:19:25,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:19:25,876 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:19:25,880 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:19:25,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2023-12-16 07:19:26,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:19:27,099 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:19:27,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2023-12-16 07:19:27,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af9fc52/2a94a3fc5817444fbdecc35adf18e5ee/FLAGf857c841d [2023-12-16 07:19:27,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af9fc52/2a94a3fc5817444fbdecc35adf18e5ee [2023-12-16 07:19:27,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:19:27,119 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:19:27,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:19:27,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:19:27,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:19:27,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b5f45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27, skipping insertion in model container [2023-12-16 07:19:27,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,146 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:19:27,266 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2023-12-16 07:19:27,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:19:27,323 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:19:27,336 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2023-12-16 07:19:27,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:19:27,369 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:19:27,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27 WrapperNode [2023-12-16 07:19:27,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:19:27,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:19:27,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:19:27,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:19:27,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,408 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2023-12-16 07:19:27,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:19:27,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:19:27,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:19:27,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:19:27,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,442 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]. [2023-12-16 07:19:27,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:19:27,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:19:27,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:19:27,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:19:27,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (1/1) ... [2023-12-16 07:19:27,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:19:27,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:19:27,485 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) [2023-12-16 07:19:27,505 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 [2023-12-16 07:19:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:19:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:19:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:19:27,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:19:27,566 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:19:27,568 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:19:27,790 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:19:27,809 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:19:27,809 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 07:19:27,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:27 BoogieIcfgContainer [2023-12-16 07:19:27,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:19:27,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:19:27,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:19:27,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:19:27,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:19:27" (1/3) ... [2023-12-16 07:19:27,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539d2e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:27, skipping insertion in model container [2023-12-16 07:19:27,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:27" (2/3) ... [2023-12-16 07:19:27,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539d2e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:27, skipping insertion in model container [2023-12-16 07:19:27,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:27" (3/3) ... [2023-12-16 07:19:27,815 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2023-12-16 07:19:27,827 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:19:27,827 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 07:19:27,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:19:27,858 INFO L357 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, mHoare=true, 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;@2318922a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:19:27,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 07:19:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 07:19:27,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:27,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:27,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:27,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:27,869 INFO L85 PathProgramCache]: Analyzing trace with hash 459643034, now seen corresponding path program 1 times [2023-12-16 07:19:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:27,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800978131] [2023-12-16 07:19:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:27,878 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 [2023-12-16 07:19:27,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:27,906 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) [2023-12-16 07:19:27,907 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 [2023-12-16 07:19:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:28,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 07:19:28,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:28,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:28,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800978131] [2023-12-16 07:19:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800978131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:19:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059886910] [2023-12-16 07:19:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:28,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 07:19:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:28,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 07:19:28,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:19:28,083 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:28,106 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2023-12-16 07:19:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 07:19:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-16 07:19:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:28,115 INFO L225 Difference]: With dead ends: 50 [2023-12-16 07:19:28,115 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 07:19:28,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:19:28,122 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 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 [2023-12-16 07:19:28,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:19:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 07:19:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-16 07:19:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2023-12-16 07:19:28,151 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2023-12-16 07:19:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:28,151 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2023-12-16 07:19:28,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2023-12-16 07:19:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 07:19:28,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:28,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:28,156 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 (2)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:28,356 WARN L477 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 [2023-12-16 07:19:28,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:28,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash 371044600, now seen corresponding path program 1 times [2023-12-16 07:19:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457791479] [2023-12-16 07:19:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:28,361 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 [2023-12-16 07:19:28,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:28,363 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) [2023-12-16 07:19:28,371 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 [2023-12-16 07:19:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:28,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 07:19:28,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:28,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:28,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457791479] [2023-12-16 07:19:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457791479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:28,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:19:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239069578] [2023-12-16 07:19:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:28,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:19:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:19:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:19:28,469 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:28,575 INFO L93 Difference]: Finished difference Result 109 states and 195 transitions. [2023-12-16 07:19:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:19:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-16 07:19:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:28,577 INFO L225 Difference]: With dead ends: 109 [2023-12-16 07:19:28,577 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 07:19:28,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:19:28,578 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 88 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:28,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 122 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 07:19:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-12-16 07:19:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-12-16 07:19:28,586 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 10 [2023-12-16 07:19:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:28,586 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-12-16 07:19:28,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-12-16 07:19:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 07:19:28,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:28,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:28,606 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 (3)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:28,789 WARN L477 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 [2023-12-16 07:19:28,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:28,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -450690481, now seen corresponding path program 1 times [2023-12-16 07:19:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543056964] [2023-12-16 07:19:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:28,791 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 [2023-12-16 07:19:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:28,792 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) [2023-12-16 07:19:28,794 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 [2023-12-16 07:19:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:28,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:19:28,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:28,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:28,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543056964] [2023-12-16 07:19:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543056964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 07:19:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868122890] [2023-12-16 07:19:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:28,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:19:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:28,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:19:28,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:19:28,854 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:29,007 INFO L93 Difference]: Finished difference Result 153 states and 262 transitions. [2023-12-16 07:19:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:19:29,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-12-16 07:19:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:29,012 INFO L225 Difference]: With dead ends: 153 [2023-12-16 07:19:29,012 INFO L226 Difference]: Without dead ends: 126 [2023-12-16 07:19:29,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:19:29,015 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 134 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:29,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 254 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-16 07:19:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2023-12-16 07:19:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-12-16 07:19:29,031 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 11 [2023-12-16 07:19:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:29,032 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-12-16 07:19:29,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-12-16 07:19:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 07:19:29,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:29,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:29,048 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 [2023-12-16 07:19:29,236 WARN L477 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 [2023-12-16 07:19:29,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:29,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash -950257841, now seen corresponding path program 1 times [2023-12-16 07:19:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:29,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251233555] [2023-12-16 07:19:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:29,238 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 [2023-12-16 07:19:29,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:29,239 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) [2023-12-16 07:19:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:29,277 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 [2023-12-16 07:19:29,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 07:19:29,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:29,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:29,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251233555] [2023-12-16 07:19:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251233555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:29,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:29,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 07:19:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74254410] [2023-12-16 07:19:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:29,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:19:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:19:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:19:29,318 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) [2023-12-16 07:19:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:29,441 INFO L93 Difference]: Finished difference Result 197 states and 329 transitions. [2023-12-16 07:19:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:19:29,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 [2023-12-16 07:19:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:29,442 INFO L225 Difference]: With dead ends: 197 [2023-12-16 07:19:29,442 INFO L226 Difference]: Without dead ends: 170 [2023-12-16 07:19:29,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:19:29,443 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 180 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:29,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 479 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-16 07:19:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 79. [2023-12-16 07:19:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-12-16 07:19:29,465 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 12 [2023-12-16 07:19:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:29,465 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-12-16 07:19:29,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) [2023-12-16 07:19:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-12-16 07:19:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 07:19:29,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:29,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:29,468 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 [2023-12-16 07:19:29,667 WARN L477 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 [2023-12-16 07:19:29,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:29,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1569702093, now seen corresponding path program 1 times [2023-12-16 07:19:29,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:29,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352372986] [2023-12-16 07:19:29,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:29,669 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 [2023-12-16 07:19:29,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:29,670 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) [2023-12-16 07:19:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:29,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:19:29,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:29,695 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 [2023-12-16 07:19:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:29,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:29,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:29,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352372986] [2023-12-16 07:19:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352372986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:29,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:29,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 07:19:29,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985695946] [2023-12-16 07:19:29,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:29,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 07:19:29,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:29,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 07:19:29,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:19:29,725 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2023-12-16 07:19:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:29,867 INFO L93 Difference]: Finished difference Result 212 states and 342 transitions. [2023-12-16 07:19:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 07:19:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 [2023-12-16 07:19:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:29,868 INFO L225 Difference]: With dead ends: 212 [2023-12-16 07:19:29,868 INFO L226 Difference]: Without dead ends: 185 [2023-12-16 07:19:29,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:19:29,869 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 218 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:29,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 619 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-16 07:19:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 85. [2023-12-16 07:19:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 84 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2023-12-16 07:19:29,874 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 12 [2023-12-16 07:19:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:29,874 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2023-12-16 07:19:29,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2023-12-16 07:19:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2023-12-16 07:19:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 07:19:29,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:29,875 INFO L195 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] [2023-12-16 07:19:29,890 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 [2023-12-16 07:19:30,078 WARN L477 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 [2023-12-16 07:19:30,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:30,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash -171126915, now seen corresponding path program 1 times [2023-12-16 07:19:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614863338] [2023-12-16 07:19:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:30,080 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 [2023-12-16 07:19:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:30,082 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) [2023-12-16 07:19:30,084 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 [2023-12-16 07:19:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:30,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 07:19:30,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:30,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:30,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:30,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614863338] [2023-12-16 07:19:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614863338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:19:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424636124] [2023-12-16 07:19:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:30,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:19:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:30,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:19:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:19:30,146 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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) [2023-12-16 07:19:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:30,227 INFO L93 Difference]: Finished difference Result 236 states and 352 transitions. [2023-12-16 07:19:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:19:30,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 23 [2023-12-16 07:19:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:30,228 INFO L225 Difference]: With dead ends: 236 [2023-12-16 07:19:30,228 INFO L226 Difference]: Without dead ends: 167 [2023-12-16 07:19:30,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:19:30,229 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:30,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 137 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-16 07:19:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 95. [2023-12-16 07:19:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 94 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2023-12-16 07:19:30,234 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 23 [2023-12-16 07:19:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:30,234 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2023-12-16 07:19:30,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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) [2023-12-16 07:19:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2023-12-16 07:19:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 07:19:30,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:30,235 INFO L195 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] [2023-12-16 07:19:30,239 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 (7)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:30,437 WARN L477 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 [2023-12-16 07:19:30,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:30,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1205485431, now seen corresponding path program 1 times [2023-12-16 07:19:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700546630] [2023-12-16 07:19:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:30,438 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 [2023-12-16 07:19:30,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:30,445 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) [2023-12-16 07:19:30,446 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 [2023-12-16 07:19:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:30,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:19:30,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:30,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:30,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700546630] [2023-12-16 07:19:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700546630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:19:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859955695] [2023-12-16 07:19:30,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:30,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:19:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:19:30,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:19:30,498 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 5 states, 5 states have (on average 4.8) 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) [2023-12-16 07:19:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:30,581 INFO L93 Difference]: Finished difference Result 314 states and 468 transitions. [2023-12-16 07:19:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:19:30,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) 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 24 [2023-12-16 07:19:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:30,582 INFO L225 Difference]: With dead ends: 314 [2023-12-16 07:19:30,583 INFO L226 Difference]: Without dead ends: 245 [2023-12-16 07:19:30,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:19:30,583 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 142 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:30,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 290 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-16 07:19:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 95. [2023-12-16 07:19:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 94 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2023-12-16 07:19:30,589 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 24 [2023-12-16 07:19:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:30,589 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2023-12-16 07:19:30,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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) [2023-12-16 07:19:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2023-12-16 07:19:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 07:19:30,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:30,590 INFO L195 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] [2023-12-16 07:19:30,600 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:30,792 WARN L477 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 [2023-12-16 07:19:30,793 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:30,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1409794344, now seen corresponding path program 1 times [2023-12-16 07:19:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:30,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265950481] [2023-12-16 07:19:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:30,794 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 [2023-12-16 07:19:30,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:30,795 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) [2023-12-16 07:19:30,797 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 [2023-12-16 07:19:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:30,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:19:30,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:30,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:30,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:30,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265950481] [2023-12-16 07:19:30,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265950481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:30,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:30,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 07:19:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461743190] [2023-12-16 07:19:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:30,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 07:19:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 07:19:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:19:30,880 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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) [2023-12-16 07:19:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:31,035 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2023-12-16 07:19:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 07:19:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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 [2023-12-16 07:19:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:31,037 INFO L225 Difference]: With dead ends: 386 [2023-12-16 07:19:31,037 INFO L226 Difference]: Without dead ends: 317 [2023-12-16 07:19:31,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:19:31,039 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 240 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:31,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 711 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-16 07:19:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 155. [2023-12-16 07:19:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4610389610389611) internal successors, (225), 154 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2023-12-16 07:19:31,048 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 25 [2023-12-16 07:19:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:31,048 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2023-12-16 07:19:31,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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) [2023-12-16 07:19:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2023-12-16 07:19:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 07:19:31,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:31,052 INFO L195 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] [2023-12-16 07:19:31,062 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 [2023-12-16 07:19:31,254 WARN L477 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 [2023-12-16 07:19:31,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:31,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1628649062, now seen corresponding path program 1 times [2023-12-16 07:19:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:31,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291324123] [2023-12-16 07:19:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:31,257 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 [2023-12-16 07:19:31,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:31,258 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) [2023-12-16 07:19:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:31,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 07:19:31,305 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 [2023-12-16 07:19:31,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:31,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:31,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:31,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291324123] [2023-12-16 07:19:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291324123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:31,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:31,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 07:19:31,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089187034] [2023-12-16 07:19:31,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:31,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:19:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:19:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:19:31,345 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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) [2023-12-16 07:19:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:31,468 INFO L93 Difference]: Finished difference Result 384 states and 566 transitions. [2023-12-16 07:19:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:19:31,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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 [2023-12-16 07:19:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:31,469 INFO L225 Difference]: With dead ends: 384 [2023-12-16 07:19:31,469 INFO L226 Difference]: Without dead ends: 315 [2023-12-16 07:19:31,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:19:31,472 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 195 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:31,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 405 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-12-16 07:19:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 145. [2023-12-16 07:19:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4583333333333333) internal successors, (210), 144 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2023-12-16 07:19:31,478 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 25 [2023-12-16 07:19:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:31,479 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2023-12-16 07:19:31,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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) [2023-12-16 07:19:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2023-12-16 07:19:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 07:19:31,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:31,481 INFO L195 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] [2023-12-16 07:19:31,495 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:31,683 WARN L477 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 [2023-12-16 07:19:31,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:31,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1173091825, now seen corresponding path program 1 times [2023-12-16 07:19:31,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:31,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411697981] [2023-12-16 07:19:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:31,685 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 [2023-12-16 07:19:31,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:31,686 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) [2023-12-16 07:19:31,687 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 [2023-12-16 07:19:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:31,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:19:31,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:31,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:31,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411697981] [2023-12-16 07:19:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411697981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:31,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:31,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 07:19:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133998371] [2023-12-16 07:19:31,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:31,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:19:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:19:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:19:31,770 INFO L87 Difference]: Start difference. First operand 145 states and 210 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) [2023-12-16 07:19:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:31,936 INFO L93 Difference]: Finished difference Result 330 states and 497 transitions. [2023-12-16 07:19:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:19:31,936 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 27 [2023-12-16 07:19:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:31,937 INFO L225 Difference]: With dead ends: 330 [2023-12-16 07:19:31,937 INFO L226 Difference]: Without dead ends: 259 [2023-12-16 07:19:31,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:19:31,938 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:31,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 132 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-12-16 07:19:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 254. [2023-12-16 07:19:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4110671936758894) internal successors, (357), 253 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 357 transitions. [2023-12-16 07:19:31,948 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 357 transitions. Word has length 27 [2023-12-16 07:19:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:31,950 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 357 transitions. [2023-12-16 07:19:31,950 INFO L496 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) [2023-12-16 07:19:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 357 transitions. [2023-12-16 07:19:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 07:19:31,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:31,965 INFO L195 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] [2023-12-16 07:19:31,973 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:32,169 WARN L477 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 [2023-12-16 07:19:32,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:32,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1213817478, now seen corresponding path program 1 times [2023-12-16 07:19:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:32,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807901187] [2023-12-16 07:19:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:32,170 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 [2023-12-16 07:19:32,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:32,171 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) [2023-12-16 07:19:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:32,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 07:19:32,220 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 [2023-12-16 07:19:32,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:32,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:32,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:32,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807901187] [2023-12-16 07:19:32,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807901187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:32,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:32,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 07:19:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272197425] [2023-12-16 07:19:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:32,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:19:32,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:19:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:19:32,277 INFO L87 Difference]: Start difference. First operand 254 states and 357 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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) [2023-12-16 07:19:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:32,434 INFO L93 Difference]: Finished difference Result 440 states and 645 transitions. [2023-12-16 07:19:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:19:32,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 28 [2023-12-16 07:19:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:32,435 INFO L225 Difference]: With dead ends: 440 [2023-12-16 07:19:32,435 INFO L226 Difference]: Without dead ends: 369 [2023-12-16 07:19:32,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:19:32,436 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 112 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:32,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 240 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-16 07:19:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 254. [2023-12-16 07:19:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4110671936758894) internal successors, (357), 253 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 357 transitions. [2023-12-16 07:19:32,460 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 357 transitions. Word has length 28 [2023-12-16 07:19:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:32,461 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 357 transitions. [2023-12-16 07:19:32,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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) [2023-12-16 07:19:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 357 transitions. [2023-12-16 07:19:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 07:19:32,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:32,462 INFO L195 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] [2023-12-16 07:19:32,468 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:32,663 WARN L477 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 [2023-12-16 07:19:32,664 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:32,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895750, now seen corresponding path program 1 times [2023-12-16 07:19:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581767725] [2023-12-16 07:19:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:32,664 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 [2023-12-16 07:19:32,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:32,666 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) [2023-12-16 07:19:32,670 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 [2023-12-16 07:19:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:32,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:19:32,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:32,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:32,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581767725] [2023-12-16 07:19:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581767725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 07:19:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521735630] [2023-12-16 07:19:32,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:32,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 07:19:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 07:19:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:19:32,756 INFO L87 Difference]: Start difference. First operand 254 states and 357 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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) [2023-12-16 07:19:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:32,901 INFO L93 Difference]: Finished difference Result 486 states and 699 transitions. [2023-12-16 07:19:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 07:19:32,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 [2023-12-16 07:19:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:32,903 INFO L225 Difference]: With dead ends: 486 [2023-12-16 07:19:32,903 INFO L226 Difference]: Without dead ends: 415 [2023-12-16 07:19:32,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:19:32,903 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 180 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:32,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 418 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-16 07:19:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 190. [2023-12-16 07:19:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 189 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 263 transitions. [2023-12-16 07:19:32,911 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 263 transitions. Word has length 29 [2023-12-16 07:19:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:32,911 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 263 transitions. [2023-12-16 07:19:32,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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) [2023-12-16 07:19:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 263 transitions. [2023-12-16 07:19:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 07:19:32,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:32,911 INFO L195 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] [2023-12-16 07:19:32,928 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:33,113 WARN L477 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 [2023-12-16 07:19:33,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:33,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1436882244, now seen corresponding path program 1 times [2023-12-16 07:19:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:33,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992273921] [2023-12-16 07:19:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:33,114 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 [2023-12-16 07:19:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:33,115 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) [2023-12-16 07:19:33,116 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 [2023-12-16 07:19:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:33,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:19:33,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:33,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:33,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992273921] [2023-12-16 07:19:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992273921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:33,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:19:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655842968] [2023-12-16 07:19:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:33,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:19:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:19:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:19:33,205 INFO L87 Difference]: Start difference. First operand 190 states and 263 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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) [2023-12-16 07:19:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:33,344 INFO L93 Difference]: Finished difference Result 426 states and 602 transitions. [2023-12-16 07:19:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:19:33,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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 [2023-12-16 07:19:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:33,346 INFO L225 Difference]: With dead ends: 426 [2023-12-16 07:19:33,346 INFO L226 Difference]: Without dead ends: 324 [2023-12-16 07:19:33,346 INFO L412 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 [2023-12-16 07:19:33,347 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 86 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:33,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 134 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-12-16 07:19:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 288. [2023-12-16 07:19:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.3797909407665505) internal successors, (396), 287 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 396 transitions. [2023-12-16 07:19:33,356 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 396 transitions. Word has length 29 [2023-12-16 07:19:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:33,357 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 396 transitions. [2023-12-16 07:19:33,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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) [2023-12-16 07:19:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 396 transitions. [2023-12-16 07:19:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 07:19:33,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:33,357 INFO L195 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] [2023-12-16 07:19:33,367 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:33,559 WARN L477 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 [2023-12-16 07:19:33,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:33,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -80808138, now seen corresponding path program 1 times [2023-12-16 07:19:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:33,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780322159] [2023-12-16 07:19:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:33,560 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 [2023-12-16 07:19:33,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:33,567 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) [2023-12-16 07:19:33,568 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 [2023-12-16 07:19:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:33,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 07:19:33,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:33,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:19:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:33,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:33,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780322159] [2023-12-16 07:19:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780322159] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:19:33,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:19:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 07:19:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129880202] [2023-12-16 07:19:33,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:19:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 07:19:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 07:19:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 07:19:33,750 INFO L87 Difference]: Start difference. First operand 288 states and 396 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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) [2023-12-16 07:19:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:34,394 INFO L93 Difference]: Finished difference Result 953 states and 1404 transitions. [2023-12-16 07:19:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 07:19:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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 30 [2023-12-16 07:19:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:34,397 INFO L225 Difference]: With dead ends: 953 [2023-12-16 07:19:34,397 INFO L226 Difference]: Without dead ends: 765 [2023-12-16 07:19:34,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2023-12-16 07:19:34,398 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 660 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:34,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 277 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 07:19:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-12-16 07:19:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 600. [2023-12-16 07:19:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4307178631051753) internal successors, (857), 599 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 857 transitions. [2023-12-16 07:19:34,418 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 857 transitions. Word has length 30 [2023-12-16 07:19:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:34,418 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 857 transitions. [2023-12-16 07:19:34,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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) [2023-12-16 07:19:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 857 transitions. [2023-12-16 07:19:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 07:19:34,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:34,418 INFO L195 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] [2023-12-16 07:19:34,441 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 [2023-12-16 07:19:34,641 WARN L477 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 [2023-12-16 07:19:34,641 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:34,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash 145141799, now seen corresponding path program 1 times [2023-12-16 07:19:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:34,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655391760] [2023-12-16 07:19:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:34,642 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 [2023-12-16 07:19:34,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:34,655 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) [2023-12-16 07:19:34,657 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 [2023-12-16 07:19:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:34,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:19:34,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:34,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:34,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655391760] [2023-12-16 07:19:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655391760] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:34,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:34,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:19:34,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895787595] [2023-12-16 07:19:34,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:34,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:19:34,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:34,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:19:34,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:19:34,692 INFO L87 Difference]: Start difference. First operand 600 states and 857 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:34,720 INFO L93 Difference]: Finished difference Result 858 states and 1221 transitions. [2023-12-16 07:19:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:19:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 [2023-12-16 07:19:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:34,722 INFO L225 Difference]: With dead ends: 858 [2023-12-16 07:19:34,722 INFO L226 Difference]: Without dead ends: 792 [2023-12-16 07:19:34,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:19:34,724 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:34,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:19:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-12-16 07:19:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 696. [2023-12-16 07:19:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.460431654676259) internal successors, (1015), 695 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1015 transitions. [2023-12-16 07:19:34,746 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1015 transitions. Word has length 31 [2023-12-16 07:19:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:34,747 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 1015 transitions. [2023-12-16 07:19:34,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1015 transitions. [2023-12-16 07:19:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 07:19:34,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:34,748 INFO L195 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] [2023-12-16 07:19:34,757 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 (16)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:34,950 WARN L477 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 [2023-12-16 07:19:34,950 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:34,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash 846206377, now seen corresponding path program 1 times [2023-12-16 07:19:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:34,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099738992] [2023-12-16 07:19:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:34,951 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 [2023-12-16 07:19:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:34,953 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) [2023-12-16 07:19:34,954 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 [2023-12-16 07:19:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:34,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 07:19:34,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:35,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:19:35,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099738992] [2023-12-16 07:19:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099738992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:19:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:19:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:19:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444631361] [2023-12-16 07:19:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:19:35,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:19:35,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:35,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:19:35,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:19:35,002 INFO L87 Difference]: Start difference. First operand 696 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:35,112 INFO L93 Difference]: Finished difference Result 906 states and 1327 transitions. [2023-12-16 07:19:35,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:19:35,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 [2023-12-16 07:19:35,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:35,115 INFO L225 Difference]: With dead ends: 906 [2023-12-16 07:19:35,116 INFO L226 Difference]: Without dead ends: 768 [2023-12-16 07:19:35,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:19:35,116 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:35,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:19:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2023-12-16 07:19:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 721. [2023-12-16 07:19:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 1.4319444444444445) internal successors, (1031), 720 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1031 transitions. [2023-12-16 07:19:35,144 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1031 transitions. Word has length 31 [2023-12-16 07:19:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:35,144 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 1031 transitions. [2023-12-16 07:19:35,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1031 transitions. [2023-12-16 07:19:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 07:19:35,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:35,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:35,164 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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:35,364 WARN L477 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 [2023-12-16 07:19:35,365 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:35,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1892939112, now seen corresponding path program 1 times [2023-12-16 07:19:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:35,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154169839] [2023-12-16 07:19:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:35,366 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 [2023-12-16 07:19:35,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:35,367 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) [2023-12-16 07:19:35,370 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 [2023-12-16 07:19:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:35,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:19:35,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:35,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:19:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:19:35,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154169839] [2023-12-16 07:19:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154169839] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:19:35,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:19:35,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 07:19:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408177142] [2023-12-16 07:19:35,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:19:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 07:19:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 07:19:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-16 07:19:35,459 INFO L87 Difference]: Start difference. First operand 721 states and 1031 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:35,694 INFO L93 Difference]: Finished difference Result 2055 states and 3157 transitions. [2023-12-16 07:19:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 07:19:35,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 37 [2023-12-16 07:19:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:35,698 INFO L225 Difference]: With dead ends: 2055 [2023-12-16 07:19:35,698 INFO L226 Difference]: Without dead ends: 1377 [2023-12-16 07:19:35,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-16 07:19:35,699 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 273 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:35,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 82 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:19:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2023-12-16 07:19:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1195. [2023-12-16 07:19:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.4916247906197655) internal successors, (1781), 1194 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1781 transitions. [2023-12-16 07:19:35,738 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1781 transitions. Word has length 37 [2023-12-16 07:19:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:35,739 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1781 transitions. [2023-12-16 07:19:35,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1781 transitions. [2023-12-16 07:19:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 07:19:35,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:35,740 INFO L195 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, 1, 1] [2023-12-16 07:19:35,742 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 (18)] Ended with exit code 0 [2023-12-16 07:19:35,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2023-12-16 07:19:35,943 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:35,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:35,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1692501362, now seen corresponding path program 1 times [2023-12-16 07:19:35,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:35,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153732649] [2023-12-16 07:19:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:35,944 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 [2023-12-16 07:19:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:35,961 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2023-12-16 07:19:35,984 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 (19)] Waiting until timeout for monitored process [2023-12-16 07:19:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:19:36,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-16 07:19:36,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:19:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 07:19:37,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:19:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 07:19:38,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:19:38,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153732649] [2023-12-16 07:19:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153732649] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:19:38,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:19:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2023-12-16 07:19:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947120162] [2023-12-16 07:19:38,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:19:38,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-16 07:19:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:19:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-16 07:19:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 07:19:38,991 INFO L87 Difference]: Start difference. First operand 1195 states and 1781 transitions. Second operand has 36 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:19:44,246 INFO L93 Difference]: Finished difference Result 3344 states and 4821 transitions. [2023-12-16 07:19:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-16 07:19:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 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 49 [2023-12-16 07:19:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:19:44,256 INFO L225 Difference]: With dead ends: 3344 [2023-12-16 07:19:44,256 INFO L226 Difference]: Without dead ends: 3236 [2023-12-16 07:19:44,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1273, Invalid=3839, Unknown=0, NotChecked=0, Total=5112 [2023-12-16 07:19:44,258 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 1661 mSDsluCounter, 4360 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:19:44,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 4690 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 07:19:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2023-12-16 07:19:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 1275. [2023-12-16 07:19:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.4748822605965464) internal successors, (1879), 1274 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1879 transitions. [2023-12-16 07:19:44,329 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1879 transitions. Word has length 49 [2023-12-16 07:19:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:19:44,329 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1879 transitions. [2023-12-16 07:19:44,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:19:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1879 transitions. [2023-12-16 07:19:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 07:19:44,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:19:44,331 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:44,333 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 (19)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:44,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2023-12-16 07:19:44,533 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:19:44,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:19:44,534 INFO L85 PathProgramCache]: Analyzing trace with hash 792282682, now seen corresponding path program 1 times [2023-12-16 07:19:44,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:19:44,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231117626] [2023-12-16 07:19:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:19:44,534 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 [2023-12-16 07:19:44,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:19:44,535 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2023-12-16 07:19:44,539 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 (20)] Waiting until timeout for monitored process [2023-12-16 07:19:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 07:19:44,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 07:19:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 07:19:44,612 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 07:19:44,612 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 07:19:44,613 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 07:19:44,619 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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 07:19:44,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2023-12-16 07:19:44,822 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:19:44,824 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:19:44,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:19:44 BoogieIcfgContainer [2023-12-16 07:19:44,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:19:44,876 INFO L158 Benchmark]: Toolchain (without parser) took 17757.38ms. Allocated memory was 248.5MB in the beginning and 358.6MB in the end (delta: 110.1MB). Free memory was 203.3MB in the beginning and 134.8MB in the end (delta: 68.5MB). Peak memory consumption was 179.6MB. Max. memory is 8.0GB. [2023-12-16 07:19:44,876 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 206.6MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:19:44,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.46ms. Allocated memory is still 248.5MB. Free memory was 202.7MB in the beginning and 189.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 07:19:44,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.70ms. Allocated memory is still 248.5MB. Free memory was 189.6MB in the beginning and 188.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:19:44,877 INFO L158 Benchmark]: Boogie Preprocessor took 49.24ms. Allocated memory is still 248.5MB. Free memory was 188.1MB in the beginning and 185.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:19:44,877 INFO L158 Benchmark]: RCFGBuilder took 351.05ms. Allocated memory is still 248.5MB. Free memory was 185.4MB in the beginning and 167.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 07:19:44,877 INFO L158 Benchmark]: TraceAbstraction took 17064.73ms. Allocated memory was 248.5MB in the beginning and 358.6MB in the end (delta: 110.1MB). Free memory was 166.0MB in the beginning and 134.8MB in the end (delta: 31.2MB). Peak memory consumption was 141.9MB. Max. memory is 8.0GB. [2023-12-16 07:19:44,878 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.14ms. Allocated memory is still 206.6MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.46ms. Allocated memory is still 248.5MB. Free memory was 202.7MB in the beginning and 189.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.70ms. Allocated memory is still 248.5MB. Free memory was 189.6MB in the beginning and 188.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.24ms. Allocated memory is still 248.5MB. Free memory was 188.1MB in the beginning and 185.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.05ms. Allocated memory is still 248.5MB. Free memory was 185.4MB in the beginning and 167.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 17064.73ms. Allocated memory was 248.5MB in the beginning and 358.6MB in the end (delta: 110.1MB). Free memory was 166.0MB in the beginning and 134.8MB in the end (delta: 31.2MB). Peak memory consumption was 141.9MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 25]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] 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 [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=0, na=1, nb=1, partial_sum=255] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=1, i=0, na=1, nb=1, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L89] COND FALSE !(i < nb) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=255, a0=0, a1=0, a2=0, a3=0, a=0, b0=-1, b1=0, b2=0, b3=0, b=255, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4368 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4368 mSDsluCounter, 9231 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7347 mSDsCounter, 480 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5529 IncrementalHoareTripleChecker+Invalid, 6009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 480 mSolverCounterUnsat, 1884 mSDtfsCounter, 5529 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1275occurred in iteration=18, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 3627 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 5336 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1076 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 35/60 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 proved your program to be incorrect! [2023-12-16 07:19:44,913 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...