/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-loops/verisec_sendmail_tTflag_arr_one_loop.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:22:07,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:22:07,579 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:22:07,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:22:07,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:22:07,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:22:07,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:22:07,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:22:07,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:22:07,597 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:22:07,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:22:07,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:22:07,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:22:07,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:22:07,598 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:22:07,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:22:07,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:22:07,599 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:22:07,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:22:07,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:22:07,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:22:07,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:22:07,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:22:07,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:22:07,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:22:07,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:22:07,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:22:07,601 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:22:07,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:22:07,601 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:22:07,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:22:07,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:22:07,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:22:07,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:22:07,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:22:07,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:22:07,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:22:07,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:22:07,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:22:07,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:22:07,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:22:07,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:22:07,604 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:22:07,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:22:07,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:22:07,604 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:22:07,604 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:22:07,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:22:07,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:22:07,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:22:07,766 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:22:07,766 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:22:07,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-12-16 07:22:08,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:22:08,996 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:22:08,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-12-16 07:22:09,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20bd623fb/2c00074dc6f84e68a4ac9aed36fe6ff1/FLAGb28f7680c [2023-12-16 07:22:09,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20bd623fb/2c00074dc6f84e68a4ac9aed36fe6ff1 [2023-12-16 07:22:09,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:22:09,015 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:22:09,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:22:09,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:22:09,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:22:09,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b4e041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09, skipping insertion in model container [2023-12-16 07:22:09,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,035 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:22:09,154 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-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-12-16 07:22:09,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:22:09,176 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:22:09,184 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-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-12-16 07:22:09,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:22:09,201 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:22:09,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09 WrapperNode [2023-12-16 07:22:09,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:22:09,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:22:09,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:22:09,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:22:09,210 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:22:09" (1/1) ... [2023-12-16 07:22:09,215 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:22:09" (1/1) ... [2023-12-16 07:22:09,227 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2023-12-16 07:22:09,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:22:09,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:22:09,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:22:09,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:22:09,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,250 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2023-12-16 07:22:09,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:22:09,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:22:09,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:22:09,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:22:09,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (1/1) ... [2023-12-16 07:22:09,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:22:09,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:22:09,314 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:22:09,329 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:22:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:22:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 07:22:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 07:22:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:22:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 07:22:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 07:22:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:22:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:22:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 07:22:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 07:22:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 07:22:09,399 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:22:09,400 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:22:09,516 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:22:09,535 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:22:09,536 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 07:22:09,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:22:09 BoogieIcfgContainer [2023-12-16 07:22:09,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:22:09,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:22:09,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:22:09,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:22:09,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:22:09" (1/3) ... [2023-12-16 07:22:09,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cfd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:22:09, skipping insertion in model container [2023-12-16 07:22:09,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:22:09" (2/3) ... [2023-12-16 07:22:09,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cfd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:22:09, skipping insertion in model container [2023-12-16 07:22:09,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:22:09" (3/3) ... [2023-12-16 07:22:09,542 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2023-12-16 07:22:09,555 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:22:09,555 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 07:22:09,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:22:09,600 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;@4ee67b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:22:09,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 07:22:09,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 07:22:09,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:09,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:09,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:09,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash -137169667, now seen corresponding path program 1 times [2023-12-16 07:22:09,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:09,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137819833] [2023-12-16 07:22:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:22:09,623 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:22:09,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:09,640 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:22:09,704 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:22:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:22:09,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:22:09,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:22:09,781 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:22:09,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:22:09,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:22:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137819833] [2023-12-16 07:22:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137819833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:22:09,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:22:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:22:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111647586] [2023-12-16 07:22:09,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:22:09,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:22:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:22:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:22:09,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:22:09,826 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:22:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:22:09,878 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2023-12-16 07:22:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:22:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-16 07:22:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:22:09,886 INFO L225 Difference]: With dead ends: 25 [2023-12-16 07:22:09,886 INFO L226 Difference]: Without dead ends: 14 [2023-12-16 07:22:09,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:22:09,892 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:22:09,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:22:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-16 07:22:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 9. [2023-12-16 07:22:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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:22:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-12-16 07:22:09,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2023-12-16 07:22:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:22:09,913 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-12-16 07:22:09,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:22:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-12-16 07:22:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 07:22:09,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:09,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:09,935 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:22:10,116 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:22:10,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:10,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1692389551, now seen corresponding path program 1 times [2023-12-16 07:22:10,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555861005] [2023-12-16 07:22:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:22:10,119 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:22:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:10,120 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:22:10,145 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:22:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:22:10,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 07:22:10,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:22:10,186 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:22:10,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:22:10,206 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:22:10,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:22:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555861005] [2023-12-16 07:22:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555861005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:22:10,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:22:10,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 07:22:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982153322] [2023-12-16 07:22:10,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:22:10,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:22:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:22:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:22:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:22:10,209 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) 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:22:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:22:10,265 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-12-16 07:22:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:22:10,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) 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 8 [2023-12-16 07:22:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:22:10,266 INFO L225 Difference]: With dead ends: 28 [2023-12-16 07:22:10,266 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 07:22:10,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:22:10,268 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:22:10,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:22:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 07:22:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 12. [2023-12-16 07:22:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-12-16 07:22:10,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2023-12-16 07:22:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:22:10,271 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-12-16 07:22:10,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) 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:22:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-12-16 07:22:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 07:22:10,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:10,272 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:10,288 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:22:10,474 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:22:10,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:10,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1107644797, now seen corresponding path program 2 times [2023-12-16 07:22:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510500431] [2023-12-16 07:22:10,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:22:10,476 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:22:10,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:10,486 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:22:10,487 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:22:10,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 07:22:10,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:22:10,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:22:10,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:22:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 07:22:10,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:22:10,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:22:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510500431] [2023-12-16 07:22:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510500431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:22:10,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:22:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:22:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982904408] [2023-12-16 07:22:10,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:22:10,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:22:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:22:10,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:22:10,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:22:10,578 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:22:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:22:10,599 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-16 07:22:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:22:10,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:22:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:22:10,600 INFO L225 Difference]: With dead ends: 17 [2023-12-16 07:22:10,600 INFO L226 Difference]: Without dead ends: 13 [2023-12-16 07:22:10,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:22:10,601 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:22:10,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:22:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-16 07:22:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-16 07:22:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-16 07:22:10,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2023-12-16 07:22:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:22:10,605 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-16 07:22:10,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:22:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-16 07:22:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 07:22:10,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:10,605 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:10,610 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 07:22:10,806 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:22:10,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:10,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash -21084276, now seen corresponding path program 1 times [2023-12-16 07:22:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055035344] [2023-12-16 07:22:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:22:10,833 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:22:10,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:10,835 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:22:10,842 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:22:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:22:10,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:22:10,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:22:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:22:10,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:22:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:22:11,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:22:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055035344] [2023-12-16 07:22:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055035344] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:22:11,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:22:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 07:22:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734815298] [2023-12-16 07:22:11,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:22:11,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 07:22:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:22:11,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 07:22:11,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 07:22:11,012 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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:22:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:22:11,149 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2023-12-16 07:22:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 07:22:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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:22:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:22:11,150 INFO L225 Difference]: With dead ends: 31 [2023-12-16 07:22:11,150 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 07:22:11,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:22:11,152 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:22:11,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:22:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 07:22:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2023-12-16 07:22:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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:22:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-12-16 07:22:11,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2023-12-16 07:22:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:22:11,156 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-12-16 07:22:11,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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:22:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-12-16 07:22:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 07:22:11,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:11,156 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:11,161 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 07:22:11,359 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:22:11,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:11,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash 89607372, now seen corresponding path program 2 times [2023-12-16 07:22:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784878641] [2023-12-16 07:22:11,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:22:11,360 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:22:11,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:11,361 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:22:11,364 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:22:11,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:22:11,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:22:11,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 07:22:11,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:22:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:22:11,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:22:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:22:11,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:22:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784878641] [2023-12-16 07:22:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784878641] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:22:11,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:22:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 07:22:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766779472] [2023-12-16 07:22:11,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:22:11,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 07:22:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:22:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 07:22:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2023-12-16 07:22:11,789 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:22:11,954 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-16 07:22:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 07:22:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-16 07:22:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:22:11,955 INFO L225 Difference]: With dead ends: 32 [2023-12-16 07:22:11,955 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 07:22:11,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2023-12-16 07:22:11,956 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:22:11,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:22:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 07:22:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2023-12-16 07:22:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-12-16 07:22:11,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2023-12-16 07:22:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:22:11,960 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-12-16 07:22:11,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-12-16 07:22:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 07:22:11,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:11,961 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:11,970 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 (6)] Ended with exit code 0 [2023-12-16 07:22:12,163 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:22:12,164 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:12,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1966567974, now seen corresponding path program 3 times [2023-12-16 07:22:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948868225] [2023-12-16 07:22:12,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:22:12,165 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:22:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:12,166 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:22:12,172 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:22:12,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 07:22:12,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:22:12,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 07:22:12,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:22:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 07:22:12,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:22:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 07:22:12,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:22:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948868225] [2023-12-16 07:22:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948868225] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:22:12,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:22:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 07:22:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709089869] [2023-12-16 07:22:12,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:22:12,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 07:22:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:22:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 07:22:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 07:22:12,368 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:22:12,515 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-16 07:22:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 07:22:12,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-16 07:22:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:22:12,516 INFO L225 Difference]: With dead ends: 31 [2023-12-16 07:22:12,516 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 07:22:12,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-12-16 07:22:12,517 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:22:12,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:22:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 07:22:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 07:22:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:22:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-12-16 07:22:12,522 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2023-12-16 07:22:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:22:12,523 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-12-16 07:22:12,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-12-16 07:22:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 07:22:12,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:12,523 INFO L195 NwaCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:12,541 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:22:12,725 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:22:12,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:12,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1018868689, now seen corresponding path program 4 times [2023-12-16 07:22:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738576759] [2023-12-16 07:22:12,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:22:12,727 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:22:12,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:12,728 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:22:12,729 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:22:12,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:22:12,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:22:12,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 07:22:12,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:22:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 07:22:13,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:22:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 07:22:15,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:22:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738576759] [2023-12-16 07:22:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738576759] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:22:15,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:22:15,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 07:22:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236148482] [2023-12-16 07:22:15,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:22:15,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 07:22:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:22:15,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 07:22:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-12-16 07:22:15,418 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:22:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:22:21,409 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-12-16 07:22:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 07:22:21,409 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 22 [2023-12-16 07:22:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:22:21,410 INFO L225 Difference]: With dead ends: 43 [2023-12-16 07:22:21,410 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 07:22:21,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2023-12-16 07:22:21,411 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 07:22:21,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 07:22:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 07:22:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 07:22:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:22:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-12-16 07:22:21,421 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2023-12-16 07:22:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:22:21,421 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-12-16 07:22:21,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:22:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-12-16 07:22:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 07:22:21,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:22:21,422 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:22:21,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 07:22:21,625 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:22:21,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:22:21,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:22:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1682547633, now seen corresponding path program 5 times [2023-12-16 07:22:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:22:21,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597565531] [2023-12-16 07:22:21,626 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 07:22:21,626 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:22:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:22:21,631 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:22:21,633 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:22:21,907 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-12-16 07:22:21,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 07:22:21,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 07:22:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 07:22:22,126 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 07:22:22,126 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 07:22:22,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 07:22:22,134 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:22:22,328 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:22:22,330 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2023-12-16 07:22:22,333 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:22:22,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:22:22 BoogieIcfgContainer [2023-12-16 07:22:22,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:22:22,353 INFO L158 Benchmark]: Toolchain (without parser) took 13337.30ms. Allocated memory was 244.3MB in the beginning and 302.0MB in the end (delta: 57.7MB). Free memory was 196.1MB in the beginning and 209.8MB in the end (delta: -13.6MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. [2023-12-16 07:22:22,353 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:22:22,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.41ms. Allocated memory is still 244.3MB. Free memory was 196.1MB in the beginning and 184.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 07:22:22,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.52ms. Allocated memory is still 244.3MB. Free memory was 184.6MB in the beginning and 183.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 07:22:22,353 INFO L158 Benchmark]: Boogie Preprocessor took 32.05ms. Allocated memory is still 244.3MB. Free memory was 183.4MB in the beginning and 181.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:22:22,353 INFO L158 Benchmark]: RCFGBuilder took 275.77ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 167.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 07:22:22,354 INFO L158 Benchmark]: TraceAbstraction took 12814.83ms. Allocated memory was 244.3MB in the beginning and 302.0MB in the end (delta: 57.7MB). Free memory was 167.3MB in the beginning and 209.8MB in the end (delta: -42.5MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2023-12-16 07:22:22,354 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.41ms. Allocated memory is still 244.3MB. Free memory was 196.1MB in the beginning and 184.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.52ms. Allocated memory is still 244.3MB. Free memory was 184.6MB in the beginning and 183.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.05ms. Allocated memory is still 244.3MB. Free memory was 183.4MB in the beginning and 181.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 275.77ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 167.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12814.83ms. Allocated memory was 244.3MB in the beginning and 302.0MB in the end (delta: 57.7MB). Free memory was 167.3MB in the beginning and 209.8MB in the end (delta: -42.5MB). Peak memory consumption was 16.2MB. 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: 9]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] char in[11]; [L17] char *s; [L18] unsigned char c; [L19] int i, j; [L20] int idx_in; [L21] i = 0 VAL [i=0, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=1, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=2, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=3, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=4, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=5, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=6, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=7, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=8, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=9, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=10, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=11, in={5:0}] [L21] COND FALSE !(i < 11) VAL [i=11, in={5:0}] [L23] in[10] = 0 [L24] idx_in = 0 [L25] s = in [L26] i = 0 [L27] EXPR in[idx_in] [L27] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND FALSE !(('0' <= c) && (c <= '9')) VAL [c=0, i=-197980296, idx_in=10, in={5:0}, j=0, s={5:0}] [L36] CALL __VERIFIER_assert (i >= 0) [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 34 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 164 ConstructedInterpolants, 12 QuantifiedInterpolants, 690 SizeOfPredicates, 16 NumberOfNonLiveVariables, 427 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 278/432 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:22:22,377 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...