/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/prodbin-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:38:55,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:38:55,098 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 04:38:55,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:38:55,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:38:55,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:38:55,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:38:55,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:38:55,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:38:55,125 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:38:55,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:38:55,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:38:55,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:38:55,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:38:55,127 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:38:55,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:38:55,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:38:55,128 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:38:55,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:38:55,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:38:55,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:38:55,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:38:55,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:38:55,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:38:55,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:38:55,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:38:55,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:38:55,129 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:38:55,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:38:55,130 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:38:55,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:38:55,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:38:55,131 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:38:55,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:38:55,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:38:55,132 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:38:55,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:38:55,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:38:55,132 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:38:55,133 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 04:38:55,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:38:55,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:38:55,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:38:55,353 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:38:55,354 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:38:55,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2023-12-25 04:38:56,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:38:56,618 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:38:56,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2023-12-25 04:38:56,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d587f2f/53b1526e4571461282799f6a4dcb246d/FLAGb6d572c2d [2023-12-25 04:38:56,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d587f2f/53b1526e4571461282799f6a4dcb246d [2023-12-25 04:38:56,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:38:56,636 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:38:56,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:38:56,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:38:56,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:38:56,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4507b3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56, skipping insertion in model container [2023-12-25 04:38:56,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:38:56,790 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/prodbin-ll_valuebound100.c[537,550] [2023-12-25 04:38:56,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:38:56,820 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:38:56,828 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/prodbin-ll_valuebound100.c[537,550] [2023-12-25 04:38:56,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:38:56,842 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:38:56,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56 WrapperNode [2023-12-25 04:38:56,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:38:56,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:38:56,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:38:56,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:38:56,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,867 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2023-12-25 04:38:56,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:38:56,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:38:56,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:38:56,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:38:56,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,885 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 04:38:56,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:38:56,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:38:56,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:38:56,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:38:56,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (1/1) ... [2023-12-25 04:38:56,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:38:56,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:38:56,937 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 04:38:56,955 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 04:38:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:38:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:38:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:38:56,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:38:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:38:56,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:38:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:38:56,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:38:57,008 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:38:57,010 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:38:57,262 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:38:57,284 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:38:57,284 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:38:57,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:38:57 BoogieIcfgContainer [2023-12-25 04:38:57,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:38:57,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:38:57,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:38:57,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:38:57,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:38:56" (1/3) ... [2023-12-25 04:38:57,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37394675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:38:57, skipping insertion in model container [2023-12-25 04:38:57,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:38:56" (2/3) ... [2023-12-25 04:38:57,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37394675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:38:57, skipping insertion in model container [2023-12-25 04:38:57,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:38:57" (3/3) ... [2023-12-25 04:38:57,292 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound100.c [2023-12-25 04:38:57,306 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:38:57,307 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:38:57,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:38:57,353 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;@149dceb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:38:57,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:38:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:38:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:38:57,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:38:57,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:57,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:38:57,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:38:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1698673820, now seen corresponding path program 1 times [2023-12-25 04:38:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:38:57,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041710587] [2023-12-25 04:38:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:38:57,380 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 04:38:57,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:38:57,383 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 04:38:57,384 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 04:38:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:38:57,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:38:57,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:38:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 04:38:57,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:38:57,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:38:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041710587] [2023-12-25 04:38:57,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041710587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:38:57,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:38:57,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:38:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367229546] [2023-12-25 04:38:57,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:38:57,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:38:57,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:38:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:38:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:38:57,551 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:38:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:38:57,575 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-25 04:38:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:38:57,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 04:38:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:38:57,583 INFO L225 Difference]: With dead ends: 46 [2023-12-25 04:38:57,583 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 04:38:57,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 04:38:57,588 INFO L413 NwaCegarLoop]: 26 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, 26 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 04:38:57,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:38:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 04:38:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 04:38:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:38:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-25 04:38:57,611 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2023-12-25 04:38:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:38:57,612 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-25 04:38:57,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:38:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-25 04:38:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:38:57,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:38:57,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:57,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 04:38:57,814 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 04:38:57,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:38:57,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:38:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash 549966490, now seen corresponding path program 1 times [2023-12-25 04:38:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:38:57,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95587043] [2023-12-25 04:38:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:38:57,816 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 04:38:57,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:38:57,817 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 04:38:57,818 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 04:38:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:38:57,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 04:38:57,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:38:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:38:58,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:39:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:39:01,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95587043] [2023-12-25 04:39:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95587043] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:39:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:39:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 04:39:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950520829] [2023-12-25 04:39:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:39:01,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:39:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:01,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:39:01,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:39:01,949 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 04:39:07,661 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 04:39:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:09,788 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-12-25 04:39:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:39:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 04:39:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:09,804 INFO L225 Difference]: With dead ends: 34 [2023-12-25 04:39:09,804 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 04:39:09,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 04:39:09,806 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:09,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 67 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2023-12-25 04:39:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 04:39:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-25 04:39:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:39:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-25 04:39:09,811 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2023-12-25 04:39:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:09,812 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-25 04:39:09,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 04:39:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-25 04:39:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 04:39:09,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:09,813 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:09,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 04:39:10,013 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 04:39:10,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:10,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1559575677, now seen corresponding path program 1 times [2023-12-25 04:39:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29971748] [2023-12-25 04:39:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:10,015 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 04:39:10,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:10,017 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 04:39:10,018 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 04:39:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:10,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 04:39:10,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:39:10,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:39:10,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29971748] [2023-12-25 04:39:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29971748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:39:10,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:39:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 04:39:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663215986] [2023-12-25 04:39:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:39:10,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 04:39:10,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:10,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 04:39:10,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 04:39:10,378 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 04:39:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:11,030 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-12-25 04:39:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 04:39:11,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-12-25 04:39:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:11,032 INFO L225 Difference]: With dead ends: 38 [2023-12-25 04:39:11,032 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 04:39:11,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 04:39:11,033 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:11,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 04:39:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 04:39:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-25 04:39:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:39:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-25 04:39:11,039 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 29 [2023-12-25 04:39:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:11,040 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-25 04:39:11,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 04:39:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-25 04:39:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 04:39:11,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:11,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:11,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 04:39:11,251 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 04:39:11,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:11,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash 191228685, now seen corresponding path program 1 times [2023-12-25 04:39:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122206110] [2023-12-25 04:39:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:11,256 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 04:39:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:11,265 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 04:39:11,266 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 04:39:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:12,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 04:39:12,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:26,783 WARN L293 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:39:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:39:27,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:40:32,224 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvmul .cse1 .cse0) (bvadd .cse1 (bvmul (bvmul .cse1 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse0) (_ bv2 64))) (_ bv2 64))))))) is different from true [2023-12-25 04:41:02,035 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:41:06,190 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (or (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv100 32))) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvadd .cse1 (bvmul (bvmul .cse1 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse0) (_ bv2 64))) (_ bv2 64))) (bvmul .cse1 .cse0)))))) is different from true [2023-12-25 04:41:06,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:41:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122206110] [2023-12-25 04:41:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122206110] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:41:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1210522346] [2023-12-25 04:41:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:41:06,192 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:41:06,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:41:06,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 04:41:06,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-25 04:41:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:41:07,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:41:07,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:41:18,354 WARN L293 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:41:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:41:21,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:41:42,641 WARN L293 SmtUtils]: Spent 5.82s 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 04:41:47,108 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= .cse0 (bvadd (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~z~0#1|))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64))) (_ bv2 64)))))) is different from true [2023-12-25 04:42:03,242 WARN L293 SmtUtils]: Spent 5.12s 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 04:42:41,373 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:42:41,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1210522346] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:42:41,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:42:41,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2023-12-25 04:42:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171919556] [2023-12-25 04:42:41,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:42:41,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 04:42:41,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:42:41,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 04:42:41,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=256, Unknown=5, NotChecked=102, Total=420 [2023-12-25 04:42:41,376 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:42:46,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:42:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:42:50,540 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-12-25 04:42:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 04:42:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2023-12-25 04:42:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:42:50,595 INFO L225 Difference]: With dead ends: 44 [2023-12-25 04:42:50,595 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 04:42:50,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=76, Invalid=351, Unknown=5, NotChecked=120, Total=552 [2023-12-25 04:42:50,597 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-25 04:42:50,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 83 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-25 04:42:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 04:42:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-12-25 04:42:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:42:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-25 04:42:50,622 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 32 [2023-12-25 04:42:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:42:50,622 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-25 04:42:50,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:42:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-25 04:42:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 04:42:50,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:42:50,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:42:50,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 04:42:50,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:42:51,032 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 04:42:51,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:42:51,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:42:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1966236047, now seen corresponding path program 1 times [2023-12-25 04:42:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:42:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996047999] [2023-12-25 04:42:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:42:51,034 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 04:42:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:42:51,036 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 04:42:51,040 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 04:42:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:42:51,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 04:42:51,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:43:02,953 WARN L293 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:43:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:43:05,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:44:49,296 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (not (bvsge |c_ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvmul .cse0 .cse1) (bvmul (_ bv2 64) (bvmul .cse0 (bvsdiv .cse1 (_ bv2 64)))))) (= (bvsrem .cse1 (_ bv2 64)) (_ bv1 64)))) is different from true [2023-12-25 04:45:13,268 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:45:21,505 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (or (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvmul .cse0 .cse1) (bvmul (_ bv2 64) (bvmul .cse0 (bvsdiv .cse1 (_ bv2 64)))))) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv100 32))) (= (bvsrem .cse1 (_ bv2 64)) (_ bv1 64))))) is different from true [2023-12-25 04:45:21,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:45:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996047999] [2023-12-25 04:45:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996047999] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:45:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1154374009] [2023-12-25 04:45:21,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:45:21,507 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:45:21,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:45:21,522 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 04:45:21,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-25 04:45:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:45:22,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 04:45:22,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:45:33,356 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:45:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:45:35,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:46:50,646 WARN L293 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:47:46,313 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:47:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1154374009] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:47:50,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:47:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 14 [2023-12-25 04:47:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774441462] [2023-12-25 04:47:50,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:47:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 04:47:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:47:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 04:47:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=417, Unknown=6, NotChecked=86, Total=600 [2023-12-25 04:47:50,506 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:47:57,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:48:06,459 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2023-12-25 04:48:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 04:48:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2023-12-25 04:48:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:48:06,462 INFO L225 Difference]: With dead ends: 54 [2023-12-25 04:48:06,462 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 04:48:06,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 159.8s TimeCoverageRelationStatistics Valid=111, Invalid=541, Unknown=6, NotChecked=98, Total=756 [2023-12-25 04:48:06,463 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:48:06,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 118 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-12-25 04:48:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 04:48:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-12-25 04:48:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 04:48:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-25 04:48:06,470 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 32 [2023-12-25 04:48:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:48:06,470 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-25 04:48:06,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:48:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-25 04:48:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:48:06,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:48:06,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:48:06,477 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 04:48:06,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-25 04:48:06,877 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 04:48:06,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:48:06,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:48:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1307708752, now seen corresponding path program 1 times [2023-12-25 04:48:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:48:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338501855] [2023-12-25 04:48:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:48:06,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:48:06,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:48:06,880 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 04:48:06,880 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 04:48:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:48:06,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:48:06,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:48:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 04:48:24,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:48:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 04:48:32,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:48:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338501855] [2023-12-25 04:48:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338501855] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:48:32,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:48:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2023-12-25 04:48:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683879001] [2023-12-25 04:48:32,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:48:32,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 04:48:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:48:32,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 04:48:32,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-12-25 04:48:32,500 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:48:37,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:39,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:45,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:49,696 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 04:48:53,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:49:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:49:02,002 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2023-12-25 04:49:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 04:49:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2023-12-25 04:49:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:49:02,010 INFO L225 Difference]: With dead ends: 56 [2023-12-25 04:49:02,010 INFO L226 Difference]: Without dead ends: 48 [2023-12-25 04:49:02,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2023-12-25 04:49:02,011 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:49:02,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 130 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 23.0s Time] [2023-12-25 04:49:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-25 04:49:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2023-12-25 04:49:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:49:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-12-25 04:49:02,017 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 38 [2023-12-25 04:49:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:49:02,018 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-12-25 04:49:02,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:49:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-12-25 04:49:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 04:49:02,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:49:02,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:49:02,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 04:49:02,219 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 04:49:02,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:49:02,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:49:02,220 INFO L85 PathProgramCache]: Analyzing trace with hash -769612806, now seen corresponding path program 2 times [2023-12-25 04:49:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:49:02,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966490518] [2023-12-25 04:49:02,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:49:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:49:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:49:02,221 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 04:49:02,222 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 04:49:03,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:49:03,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:49:03,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 04:49:03,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:49:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 04:49:43,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:51:11,878 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= .cse0 (bvadd (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~z~0#1|))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64))) (_ bv2 64)))))) is different from true [2023-12-25 04:51:45,993 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (.cse1 (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (or (not (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1) (_ bv2 64))))) (= .cse0 (bvadd (bvmul (bvmul (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse1) (_ bv2 64)) |c_ULTIMATE.start_main_~x~0#1|) (_ bv4 64)) (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (not (= (bvsrem .cse1 (_ bv2 64)) (_ bv1 64))))) is different from true [2023-12-25 04:51:52,396 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:05,423 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:13,774 WARN L293 SmtUtils]: Spent 8.35s 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 04:52:18,423 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse0 (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1) (_ bv2 64)))) (or (not (= (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1| .cse0))) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= (bvadd (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse1) (_ bv2 64))) (_ bv4 64))) .cse0)))) is different from true [2023-12-25 04:52:36,542 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:44,952 WARN L293 SmtUtils]: Spent 8.41s 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 04:52:50,583 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:03,586 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:11,949 WARN L293 SmtUtils]: Spent 8.36s 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 04:53:16,983 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:30,303 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:38,654 WARN L293 SmtUtils]: Spent 8.35s 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 04:53:43,998 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 04:53:44,018 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:53:45,043 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 04:53:45,199 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 04:53:45,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 04:53:45,231 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:53:45,231 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 04:53:45,234 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-12-25 04:53:45,236 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:53:45,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:53:45 BoogieIcfgContainer [2023-12-25 04:53:45,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:53:45,237 INFO L158 Benchmark]: Toolchain (without parser) took 888601.11ms. Allocated memory was 211.8MB in the beginning and 295.7MB in the end (delta: 83.9MB). Free memory was 163.1MB in the beginning and 227.7MB in the end (delta: -64.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-25 04:53:45,237 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 211.8MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:53:45,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.43ms. Allocated memory is still 211.8MB. Free memory was 163.1MB in the beginning and 151.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:53:45,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.26ms. Allocated memory is still 211.8MB. Free memory was 151.6MB in the beginning and 150.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:53:45,238 INFO L158 Benchmark]: Boogie Preprocessor took 26.41ms. Allocated memory is still 211.8MB. Free memory was 150.1MB in the beginning and 148.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:53:45,238 INFO L158 Benchmark]: RCFGBuilder took 389.47ms. Allocated memory is still 211.8MB. Free memory was 148.4MB in the beginning and 136.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:53:45,238 INFO L158 Benchmark]: TraceAbstraction took 887951.25ms. Allocated memory was 211.8MB in the beginning and 295.7MB in the end (delta: 83.9MB). Free memory was 135.9MB in the beginning and 227.7MB in the end (delta: -91.8MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:53:45,239 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.13ms. Allocated memory is still 211.8MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.43ms. Allocated memory is still 211.8MB. Free memory was 163.1MB in the beginning and 151.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.26ms. Allocated memory is still 211.8MB. Free memory was 151.6MB in the beginning and 150.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.41ms. Allocated memory is still 211.8MB. Free memory was 150.1MB in the beginning and 148.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 389.47ms. Allocated memory is still 211.8MB. Free memory was 148.4MB in the beginning and 136.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 887951.25ms. Allocated memory was 211.8MB in the beginning and 295.7MB in the end (delta: 83.9MB). Free memory was 135.9MB in the beginning and 227.7MB in the end (delta: -91.8MB). There was no memory consumed. 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: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 887.9s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 63.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 43.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 492 SdHoareTripleChecker+Invalid, 41.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 102 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 249.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 535.5s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 292 ConstructedInterpolants, 3 QuantifiedInterpolants, 1824 SizeOfPredicates, 31 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 121/160 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