/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/nla-digbench-scaling/egcd3-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 02:00:23,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 02:00:23,853 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-25 02:00:23,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 02:00:23,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 02:00:23,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 02:00:23,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 02:00:23,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 02:00:23,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 02:00:23,872 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 02:00:23,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 02:00:23,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 02:00:23,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 02:00:23,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 02:00:23,874 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 02:00:23,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 02:00:23,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 02:00:23,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 02:00:23,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 02:00:23,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 02:00:23,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 02:00:23,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 02:00:23,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 02:00:23,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 02:00:23,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 02:00:23,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 02:00:23,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 02:00:23,877 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 02:00:23,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 02:00:23,877 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 02:00:23,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 02:00:23,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 02:00:23,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 02:00:23,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 02:00:23,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:00:23,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 02:00:23,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 02:00:23,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 02:00:23,879 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 02:00:23,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 02:00:23,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 02:00:23,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 02:00:23,880 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 02:00:23,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 02:00:23,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 02:00:23,880 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 02:00:23,881 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-25 02:00:24,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 02:00:24,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 02:00:24,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 02:00:24,076 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 02:00:24,076 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 02:00:24,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c [2023-12-25 02:00:25,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 02:00:25,365 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 02:00:25,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c [2023-12-25 02:00:25,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824d1af79/7896af0849fa45818ff41d8bbabb064f/FLAGb0e4c16b7 [2023-12-25 02:00:25,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824d1af79/7896af0849fa45818ff41d8bbabb064f [2023-12-25 02:00:25,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 02:00:25,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 02:00:25,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 02:00:25,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 02:00:25,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 02:00:25,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c6fca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25, skipping insertion in model container [2023-12-25 02:00:25,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,415 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 02:00:25,562 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c[490,503] [2023-12-25 02:00:25,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:00:25,590 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 02:00:25,598 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c[490,503] [2023-12-25 02:00:25,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:00:25,614 INFO L206 MainTranslator]: Completed translation [2023-12-25 02:00:25,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25 WrapperNode [2023-12-25 02:00:25,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 02:00:25,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 02:00:25,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 02:00:25,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 02:00:25,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,644 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-12-25 02:00:25,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 02:00:25,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 02:00:25,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 02:00:25,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 02:00:25,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,662 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 02:00:25,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 02:00:25,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 02:00:25,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 02:00:25,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 02:00:25,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (1/1) ... [2023-12-25 02:00:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:00:25,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 02:00:25,696 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-25 02:00:25,747 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-25 02:00:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 02:00:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 02:00:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 02:00:25,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 02:00:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 02:00:25,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 02:00:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 02:00:25,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 02:00:25,827 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 02:00:25,832 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 02:00:26,146 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 02:00:26,174 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 02:00:26,174 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-25 02:00:26,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:00:26 BoogieIcfgContainer [2023-12-25 02:00:26,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 02:00:26,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 02:00:26,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 02:00:26,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 02:00:26,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 02:00:25" (1/3) ... [2023-12-25 02:00:26,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20165c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:00:26, skipping insertion in model container [2023-12-25 02:00:26,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:00:25" (2/3) ... [2023-12-25 02:00:26,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20165c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:00:26, skipping insertion in model container [2023-12-25 02:00:26,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:00:26" (3/3) ... [2023-12-25 02:00:26,194 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound100.c [2023-12-25 02:00:26,206 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 02:00:26,207 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 02:00:26,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 02:00:26,256 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;@63b768ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 02:00:26,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 02:00:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 02:00:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 02:00:26,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:00:26,282 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:26,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:00:26,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:00:26,290 INFO L85 PathProgramCache]: Analyzing trace with hash 67099435, now seen corresponding path program 1 times [2023-12-25 02:00:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:00:26,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802948353] [2023-12-25 02:00:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:00:26,300 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-25 02:00:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:00:26,303 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-25 02:00:26,312 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-25 02:00:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:26,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 02:00:26,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:00:26,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:00:26,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:00:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802948353] [2023-12-25 02:00:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802948353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:00:26,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:00:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 02:00:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924763993] [2023-12-25 02:00:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:00:26,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 02:00:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:00:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 02:00:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:00:26,515 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:00:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:00:26,553 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2023-12-25 02:00:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 02:00:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 02:00:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:00:26,568 INFO L225 Difference]: With dead ends: 62 [2023-12-25 02:00:26,569 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 02:00:26,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:00:26,573 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 02:00:26,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 02:00:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 02:00:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 02:00:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 02:00:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-25 02:00:26,607 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 28 [2023-12-25 02:00:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:00:26,608 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-25 02:00:26,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:00:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-25 02:00:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 02:00:26,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:00:26,609 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:26,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 02:00:26,816 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-25 02:00:26,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:00:26,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:00:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1772608446, now seen corresponding path program 1 times [2023-12-25 02:00:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:00:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821849424] [2023-12-25 02:00:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:00:26,818 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-25 02:00:26,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:00:26,821 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-25 02:00:26,822 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-25 02:00:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:26,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 02:00:26,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:00:27,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:00:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:00:27,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:00:27,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821849424] [2023-12-25 02:00:27,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821849424] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:00:27,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:00:27,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2023-12-25 02:00:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483825113] [2023-12-25 02:00:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:00:27,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 02:00:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:00:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 02:00:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 02:00:27,339 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:00:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:00:27,808 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-25 02:00:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:00:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-12-25 02:00:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:00:27,815 INFO L225 Difference]: With dead ends: 39 [2023-12-25 02:00:27,815 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 02:00:27,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 02:00:27,816 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 02:00:27,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 02:00:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 02:00:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 02:00:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 02:00:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 02:00:27,823 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 29 [2023-12-25 02:00:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:00:27,824 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 02:00:27,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:00:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 02:00:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 02:00:27,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:00:27,827 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:27,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 02:00:28,034 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-25 02:00:28,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:00:28,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:00:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1072684582, now seen corresponding path program 1 times [2023-12-25 02:00:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:00:28,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845455993] [2023-12-25 02:00:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:00:28,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:00:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:00:28,041 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-25 02:00:28,049 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-25 02:00:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:28,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 02:00:28,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:00:28,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:00:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:00:33,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:00:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845455993] [2023-12-25 02:00:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845455993] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:00:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:00:33,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:00:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435155980] [2023-12-25 02:00:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:00:33,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:00:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:00:33,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:00:33,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:00:33,253 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:00:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:00:37,453 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-25 02:00:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:00:37,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-12-25 02:00:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:00:37,491 INFO L225 Difference]: With dead ends: 48 [2023-12-25 02:00:37,491 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 02:00:37,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:00:37,492 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-25 02:00:37,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-25 02:00:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 02:00:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-25 02:00:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:00:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2023-12-25 02:00:37,513 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 32 [2023-12-25 02:00:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:00:37,519 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-12-25 02:00:37,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:00:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2023-12-25 02:00:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 02:00:37,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:00:37,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:37,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 02:00:37,735 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-25 02:00:37,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:00:37,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:00:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash 581538888, now seen corresponding path program 1 times [2023-12-25 02:00:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:00:37,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146417401] [2023-12-25 02:00:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:00:37,739 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-25 02:00:37,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:00:37,740 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-25 02:00:37,745 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-25 02:00:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:37,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 02:00:37,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:00:38,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:00:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:00:39,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:00:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146417401] [2023-12-25 02:00:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146417401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:00:39,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:00:39,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-25 02:00:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841075425] [2023-12-25 02:00:39,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:00:39,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:00:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:00:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:00:39,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:00:39,105 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 02:00:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:00:44,116 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2023-12-25 02:00:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 02:00:44,124 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2023-12-25 02:00:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:00:44,126 INFO L225 Difference]: With dead ends: 113 [2023-12-25 02:00:44,126 INFO L226 Difference]: Without dead ends: 106 [2023-12-25 02:00:44,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2023-12-25 02:00:44,128 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 226 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 02:00:44,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 269 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 02:00:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-25 02:00:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2023-12-25 02:00:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:00:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2023-12-25 02:00:44,144 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 34 [2023-12-25 02:00:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:00:44,144 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2023-12-25 02:00:44,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 02:00:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2023-12-25 02:00:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 02:00:44,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:00:44,145 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:44,157 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-25 02:00:44,352 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-25 02:00:44,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:00:44,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:00:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1534715754, now seen corresponding path program 1 times [2023-12-25 02:00:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:00:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901691633] [2023-12-25 02:00:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:00:44,353 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-25 02:00:44,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:00:44,355 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-25 02:00:44,356 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-25 02:00:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:44,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 02:00:44,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:00:45,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:00:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:00:51,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:00:51,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901691633] [2023-12-25 02:00:51,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901691633] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:00:51,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:00:51,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:00:51,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329664746] [2023-12-25 02:00:51,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:00:51,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:00:51,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:00:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:00:51,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:00:51,723 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:00:55,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:01:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:00,099 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2023-12-25 02:01:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:01:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-25 02:01:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:00,134 INFO L225 Difference]: With dead ends: 60 [2023-12-25 02:01:00,134 INFO L226 Difference]: Without dead ends: 58 [2023-12-25 02:01:00,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:01:00,135 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-25 02:01:00,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-12-25 02:01:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-25 02:01:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2023-12-25 02:01:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:01:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-12-25 02:01:00,161 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 37 [2023-12-25 02:01:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:00,163 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-12-25 02:01:00,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:01:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-12-25 02:01:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 02:01:00,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:00,166 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:00,173 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-25 02:01:00,372 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-25 02:01:00,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:00,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1190433772, now seen corresponding path program 1 times [2023-12-25 02:01:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:00,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157646013] [2023-12-25 02:01:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:00,374 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-25 02:01:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:00,375 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-25 02:01:00,376 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-25 02:01:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:00,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 02:01:00,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:01:01,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:01:15,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157646013] [2023-12-25 02:01:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157646013] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:01:15,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:01:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-12-25 02:01:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943281025] [2023-12-25 02:01:15,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:01:15,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:01:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:01:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:01:15,455 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 02:01:26,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:01:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:35,298 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2023-12-25 02:01:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 02:01:35,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 37 [2023-12-25 02:01:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:35,327 INFO L225 Difference]: With dead ends: 82 [2023-12-25 02:01:35,327 INFO L226 Difference]: Without dead ends: 80 [2023-12-25 02:01:35,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-25 02:01:35,328 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-12-25 02:01:35,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 323 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 15.4s Time] [2023-12-25 02:01:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-25 02:01:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2023-12-25 02:01:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 02:01:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2023-12-25 02:01:35,352 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 37 [2023-12-25 02:01:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:35,353 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2023-12-25 02:01:35,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 02:01:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2023-12-25 02:01:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 02:01:35,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:35,354 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:35,363 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-25 02:01:35,556 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-25 02:01:35,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:35,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1246105370, now seen corresponding path program 1 times [2023-12-25 02:01:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274889386] [2023-12-25 02:01:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:35,558 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-25 02:01:35,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:35,559 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-25 02:01:35,560 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-25 02:01:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:35,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 02:01:35,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 02:01:36,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 02:01:41,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:41,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274889386] [2023-12-25 02:01:41,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274889386] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:01:41,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:01:41,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 02:01:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957541755] [2023-12-25 02:01:41,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:01:41,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:01:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:01:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:01:41,555 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 02:01:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:47,037 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2023-12-25 02:01:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:01:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2023-12-25 02:01:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:47,090 INFO L225 Difference]: With dead ends: 104 [2023-12-25 02:01:47,090 INFO L226 Difference]: Without dead ends: 102 [2023-12-25 02:01:47,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:01:47,091 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-25 02:01:47,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-25 02:01:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-25 02:01:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2023-12-25 02:01:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-25 02:01:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2023-12-25 02:01:47,122 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 42 [2023-12-25 02:01:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:47,123 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2023-12-25 02:01:47,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 02:01:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2023-12-25 02:01:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 02:01:47,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:47,126 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:47,135 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-25 02:01:47,335 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-25 02:01:47,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:47,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1174265188, now seen corresponding path program 1 times [2023-12-25 02:01:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951070688] [2023-12-25 02:01:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:47,336 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-25 02:01:47,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:47,338 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-25 02:01:47,338 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-25 02:01:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:47,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 02:01:47,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:01:49,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:02:26,688 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:02:32,980 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:02:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:02:44,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:02:44,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951070688] [2023-12-25 02:02:44,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951070688] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:02:44,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:02:44,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-12-25 02:02:44,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913801044] [2023-12-25 02:02:44,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:02:44,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 02:02:44,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:02:44,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 02:02:44,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-25 02:02:44,735 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:02:47,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 02:02:49,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:02:54,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:02:56,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:02:58,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:01,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:18,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:04,493 WARN L293 SmtUtils]: Spent 16.35s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:04:11,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:15,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:48,528 WARN L293 SmtUtils]: Spent 10.17s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:04:50,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:52,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:02,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:06,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:10,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:12,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:19,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:23,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:26,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:28,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:31,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:32,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:36,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:38,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:39,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:05:43,305 INFO L93 Difference]: Finished difference Result 203 states and 285 transitions. [2023-12-25 02:05:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 02:05:43,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2023-12-25 02:05:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:05:43,347 INFO L225 Difference]: With dead ends: 203 [2023-12-25 02:05:43,347 INFO L226 Difference]: Without dead ends: 201 [2023-12-25 02:05:43,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2023-12-25 02:05:43,348 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 247 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 130 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.0s IncrementalHoareTripleChecker+Time [2023-12-25 02:05:43,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 266 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 326 Invalid, 6 Unknown, 0 Unchecked, 84.0s Time] [2023-12-25 02:05:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-25 02:05:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2023-12-25 02:05:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.2666666666666666) internal successors, (152), 121 states have internal predecessors, (152), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-25 02:05:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2023-12-25 02:05:43,433 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 42 [2023-12-25 02:05:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:05:43,433 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2023-12-25 02:05:43,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:05:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2023-12-25 02:05:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 02:05:43,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:05:43,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:05:43,446 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 (9)] Ended with exit code 0 [2023-12-25 02:05:43,644 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-25 02:05:43,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:05:43,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:05:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash 225223382, now seen corresponding path program 1 times [2023-12-25 02:05:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:05:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513332522] [2023-12-25 02:05:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:05:43,645 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-25 02:05:43,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:05:43,646 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 02:05:43,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 02:05:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:05:43,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 02:05:43,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:05:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 02:05:44,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:05:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 02:05:49,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:05:49,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513332522] [2023-12-25 02:05:49,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513332522] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:05:49,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:05:49,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:05:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245179255] [2023-12-25 02:05:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:05:49,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:05:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:05:49,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:05:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:05:49,299 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 02:05:57,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:05:58,988 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2023-12-25 02:05:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:05:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-12-25 02:05:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:05:59,006 INFO L225 Difference]: With dead ends: 288 [2023-12-25 02:05:59,006 INFO L226 Difference]: Without dead ends: 286 [2023-12-25 02:05:59,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:05:59,007 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-25 02:05:59,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2023-12-25 02:05:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-25 02:05:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 265. [2023-12-25 02:05:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 152 states have internal predecessors, (169), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (116), 102 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-25 02:05:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2023-12-25 02:05:59,115 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 47 [2023-12-25 02:05:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:05:59,115 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2023-12-25 02:05:59,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 02:05:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2023-12-25 02:05:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 02:05:59,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:05:59,116 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:05:59,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 02:05:59,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:05:59,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:05:59,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:05:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 371933676, now seen corresponding path program 1 times [2023-12-25 02:05:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:05:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673852022] [2023-12-25 02:05:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:05:59,329 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-25 02:05:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:05:59,330 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 02:05:59,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 02:05:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:05:59,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 02:05:59,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:06:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-25 02:06:07,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:07:37,639 WARN L293 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:08:01,445 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:08:07,481 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from true [2023-12-25 02:08:15,290 WARN L293 SmtUtils]: Spent 7.81s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:08:26,450 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:19,598 WARN L293 SmtUtils]: Spent 23.04s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:10:29,506 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:35,564 WARN L293 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:43,958 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:52,608 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:56,845 WARN L854 $PredicateComparison]: unable to prove that (or (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~v~0#1|)) (not (= |c_ULTIMATE.start_main_~v~0#1| (bvmul |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from false [2023-12-25 02:11:01,098 WARN L876 $PredicateComparison]: unable to prove that (or (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~v~0#1|)) (not (= |c_ULTIMATE.start_main_~v~0#1| (bvmul |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from true [2023-12-25 02:11:12,150 WARN L293 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:20,879 WARN L293 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:27,597 WARN L293 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:31,821 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23| (_ BitVec 64)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| (_ BitVec 32))) (or (= (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) (.cse2 (bvadd |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43|))) (bvadd (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse0) (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse1) (bvneg (bvmul .cse1 (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse2)) |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8|))) (bvneg (bvmul (bvadd |v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (bvneg (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse2))) .cse0)))) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) (bvsge (bvmul (_ bv18446744073709551615 64) (bvneg |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (= (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 02:11:43,984 WARN L293 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:52,635 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:01,121 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:13,747 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:21,469 WARN L293 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:28,880 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:33,083 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23| (_ BitVec 64)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| (_ BitVec 32))) (or (= (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) (.cse2 (bvadd |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43|))) (bvadd (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse0) (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse1) (bvneg (bvmul .cse1 (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse2)) |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8|))) (bvneg (bvmul (bvadd |v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (bvneg (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse2))) .cse0)))) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) (bvsge (bvmul (_ bv18446744073709551615 64) (bvneg |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (= (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 02:12:40,792 WARN L293 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:49,330 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:57,686 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:06,208 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:17,042 WARN L293 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:24,465 WARN L293 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:33,049 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:39,103 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:49,513 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:58,115 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:03,900 WARN L293 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:15,380 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:23,980 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-25 02:15:12,611 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:15:12,631 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:15:12,633 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:15:12,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 02:15:12,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:15:12,813 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. [2023-12-25 02:15:12,817 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:15:12,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:15:12,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:15:12 BoogieIcfgContainer [2023-12-25 02:15:12,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:15:12,822 INFO L158 Benchmark]: Toolchain (without parser) took 887436.84ms. Allocated memory is still 324.0MB. Free memory was 271.4MB in the beginning and 192.2MB in the end (delta: 79.1MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. [2023-12-25 02:15:12,822 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 227.5MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:15:12,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.13ms. Allocated memory is still 324.0MB. Free memory was 271.1MB in the beginning and 259.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 02:15:12,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.87ms. Allocated memory is still 324.0MB. Free memory was 259.3MB in the beginning and 257.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:15:12,822 INFO L158 Benchmark]: Boogie Preprocessor took 26.23ms. Allocated memory is still 324.0MB. Free memory was 257.5MB in the beginning and 255.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:15:12,822 INFO L158 Benchmark]: RCFGBuilder took 503.07ms. Allocated memory is still 324.0MB. Free memory was 255.4MB in the beginning and 242.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 02:15:12,823 INFO L158 Benchmark]: TraceAbstraction took 886631.84ms. Allocated memory is still 324.0MB. Free memory was 241.2MB in the beginning and 192.2MB in the end (delta: 49.0MB). Peak memory consumption was 50.1MB. Max. memory is 8.0GB. [2023-12-25 02:15:12,823 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.12ms. Allocated memory is still 227.5MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.13ms. Allocated memory is still 324.0MB. Free memory was 271.1MB in the beginning and 259.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.87ms. Allocated memory is still 324.0MB. Free memory was 259.3MB in the beginning and 257.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.23ms. Allocated memory is still 324.0MB. Free memory was 257.5MB in the beginning and 255.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 503.07ms. Allocated memory is still 324.0MB. Free memory was 255.4MB in the beginning and 242.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 886631.84ms. Allocated memory is still 324.0MB. Free memory was 241.2MB in the beginning and 192.2MB in the end (delta: 49.0MB). Peak memory consumption was 50.1MB. 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 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.6s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 232.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 130.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 596 mSDsluCounter, 1465 SdHoareTripleChecker+Invalid, 120.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1156 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 309 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 161.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=9, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 94 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 97.5s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 611 ConstructedInterpolants, 26 QuantifiedInterpolants, 2912 SizeOfPredicates, 30 NumberOfNonLiveVariables, 621 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 387/488 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown