/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/geo3-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:12:36,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:12:36,099 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 03:12:36,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:12:36,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:12:36,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:12:36,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:12:36,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:12:36,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:12:36,123 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:12:36,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:12:36,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:12:36,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:12:36,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:12:36,124 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:12:36,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:12:36,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:12:36,125 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:12:36,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:12:36,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:12:36,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:12:36,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:12:36,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:12:36,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:12:36,132 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:12:36,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:12:36,132 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:12:36,133 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:12:36,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:12:36,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:12:36,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:12:36,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:12:36,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:12:36,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:12:36,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:12:36,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:12:36,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:12:36,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:12:36,135 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:12:36,135 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:12:36,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:12:36,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:12:36,137 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:12:36,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:12:36,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:12:36,137 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:12:36,137 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 03:12:36,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:12:36,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:12:36,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:12:36,343 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:12:36,343 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:12:36,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound20.c [2023-12-25 03:12:37,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:12:37,419 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:12:37,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound20.c [2023-12-25 03:12:37,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d097f725/ceffc56012484c3e8a796cb62d164351/FLAGff9a210e1 [2023-12-25 03:12:37,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d097f725/ceffc56012484c3e8a796cb62d164351 [2023-12-25 03:12:37,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:12:37,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:12:37,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:12:37,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:12:37,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:12:37,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbbd5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37, skipping insertion in model container [2023-12-25 03:12:37,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,462 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:12:37,577 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/geo3-ll_valuebound20.c[524,537] [2023-12-25 03:12:37,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:12:37,594 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:12:37,602 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/geo3-ll_valuebound20.c[524,537] [2023-12-25 03:12:37,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:12:37,615 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:12:37,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37 WrapperNode [2023-12-25 03:12:37,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:12:37,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:12:37,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:12:37,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:12:37,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,643 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2023-12-25 03:12:37,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:12:37,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:12:37,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:12:37,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:12:37,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,658 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 03:12:37,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:12:37,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:12:37,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:12:37,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:12:37,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (1/1) ... [2023-12-25 03:12:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:12:37,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:12:37,691 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 03:12:37,695 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 03:12:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:12:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:12:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 03:12:37,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 03:12:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:12:37,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:12:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:12:37,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:12:37,766 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:12:37,769 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:12:38,139 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:12:38,153 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:12:38,153 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 03:12:38,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:12:38 BoogieIcfgContainer [2023-12-25 03:12:38,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:12:38,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:12:38,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:12:38,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:12:38,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:12:37" (1/3) ... [2023-12-25 03:12:38,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e76f61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:12:38, skipping insertion in model container [2023-12-25 03:12:38,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:12:37" (2/3) ... [2023-12-25 03:12:38,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e76f61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:12:38, skipping insertion in model container [2023-12-25 03:12:38,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:12:38" (3/3) ... [2023-12-25 03:12:38,159 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound20.c [2023-12-25 03:12:38,172 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:12:38,172 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:12:38,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:12:38,213 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;@725b4849, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:12:38,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:12:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 03:12:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 03:12:38,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:12:38,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:12:38,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:12:38,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:12:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1436740904, now seen corresponding path program 1 times [2023-12-25 03:12:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:12:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788143123] [2023-12-25 03:12:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:12:38,233 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 03:12:38,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:12:38,235 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 03:12:38,235 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 03:12:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:12:38,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:12:38,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:12:38,368 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 03:12:38,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:12:38,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:12:38,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788143123] [2023-12-25 03:12:38,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788143123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:12:38,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:12:38,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:12:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495958397] [2023-12-25 03:12:38,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:12:38,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:12:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:12:38,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:12:38,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:12:38,410 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:12:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:12:38,442 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2023-12-25 03:12:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:12:38,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-12-25 03:12:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:12:38,449 INFO L225 Difference]: With dead ends: 44 [2023-12-25 03:12:38,449 INFO L226 Difference]: Without dead ends: 21 [2023-12-25 03:12:38,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 03:12:38,455 INFO L413 NwaCegarLoop]: 24 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, 24 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 03:12:38,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:12:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-25 03:12:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-25 03:12:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 03:12:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-12-25 03:12:38,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 24 [2023-12-25 03:12:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:12:38,486 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-12-25 03:12:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:12:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-12-25 03:12:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 03:12:38,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:12:38,488 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:12:38,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 03:12:38,694 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 03:12:38,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:12:38,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:12:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1259637422, now seen corresponding path program 1 times [2023-12-25 03:12:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:12:38,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261859595] [2023-12-25 03:12:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:12:38,696 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 03:12:38,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:12:38,697 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 03:12:38,699 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 03:12:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:12:38,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 03:12:38,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:12:40,152 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 03:12:40,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:12:44,121 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 03:12:44,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:12:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261859595] [2023-12-25 03:12:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261859595] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:12:44,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:12:44,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 03:12:44,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674525735] [2023-12-25 03:12:44,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:12:44,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:12:44,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:12:44,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:12:44,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:12:44,124 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 03:12:49,833 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 03:12:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:12:51,604 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-12-25 03:12:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:12:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 24 [2023-12-25 03:12:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:12:51,620 INFO L225 Difference]: With dead ends: 31 [2023-12-25 03:12:51,620 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 03:12:51,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 03:12:51,622 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:12:51,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2023-12-25 03:12:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 03:12:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 03:12:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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 03:12:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-25 03:12:51,627 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 24 [2023-12-25 03:12:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:12:51,628 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-25 03:12:51,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 03:12:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-25 03:12:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 03:12:51,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:12:51,629 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] [2023-12-25 03:12:51,641 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 03:12:51,836 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 03:12:51,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:12:51,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:12:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -455624649, now seen corresponding path program 1 times [2023-12-25 03:12:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:12:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036701204] [2023-12-25 03:12:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:12:51,838 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 03:12:51,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:12:51,839 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 03:12:51,844 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 03:12:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:12:52,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 03:12:52,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:12:55,550 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 03:12:55,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:13:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:13:35,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:13:35,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036701204] [2023-12-25 03:13:35,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036701204] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:13:35,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:13:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-12-25 03:13:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880756110] [2023-12-25 03:13:35,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:13:35,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 03:13:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:13:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 03:13:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2023-12-25 03:13:35,580 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 03:13:37,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 03:13:53,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:14:15,265 WARN L293 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:14:20,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:14:38,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:14:42,606 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 03:14:46,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:14:50,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:14:54,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:14:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:14:57,152 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-12-25 03:14:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 03:14:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 31 [2023-12-25 03:14:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:14:57,176 INFO L225 Difference]: With dead ends: 46 [2023-12-25 03:14:57,176 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 03:14:57,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 72.7s TimeCoverageRelationStatistics Valid=62, Invalid=241, Unknown=3, NotChecked=0, Total=306 [2023-12-25 03:14:57,177 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:14:57,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 136 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 40.5s Time] [2023-12-25 03:14:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 03:14:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-25 03:14:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 03:14:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-12-25 03:14:57,186 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 31 [2023-12-25 03:14:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:14:57,186 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-12-25 03:14:57,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 03:14:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-12-25 03:14:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 03:14:57,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:14:57,187 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:14:57,208 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 03:14:57,409 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 03:14:57,411 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:14:57,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:14:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1540289938, now seen corresponding path program 2 times [2023-12-25 03:14:57,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:14:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354685507] [2023-12-25 03:14:57,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:14:57,415 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 03:14:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:14:57,416 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 03:14:57,424 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 03:14:59,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:14:59,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:14:59,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 03:14:59,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:16:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 03:16:30,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:18:00,737 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (or (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) |c_ULTIMATE.start_main_~az~0#1|)) (bvmul .cse0 .cse1) (bvneg (bvadd .cse0 .cse2)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse2 (bvneg (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~az~0#1|)))))))) is different from true [2023-12-25 03:18:21,976 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:18:27,743 WARN L293 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:18:35,716 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse4 (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (.cse3 (bvmul .cse0 .cse1)) (.cse2 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1))) (or (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse2 |c_ULTIMATE.start_main_~az~0#1|)) .cse3 (bvneg .cse4)))) (= (_ bv0 64) (bvadd .cse0 (bvneg (bvadd .cse0 (bvmul .cse4 .cse1))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) (bvmul .cse0 .cse1 .cse1) .cse3 (bvneg (bvmul (bvmul .cse2 .cse1) |c_ULTIMATE.start_main_~az~0#1|))))))) is different from true [2023-12-25 03:18:48,008 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:18:56,408 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:19:05,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse5 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (let ((.cse4 (bvadd .cse0 .cse5)) (.cse3 (bvmul .cse0 .cse1)) (.cse2 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1))) (or (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse2 |c_ULTIMATE.start_main_~az~0#1|)) .cse3 (bvneg .cse4)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse5 (bvneg (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~az~0#1|))))) (= (_ bv0 64) (bvadd .cse0 (bvneg (bvadd .cse0 (bvmul .cse4 .cse1))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) (bvmul .cse0 .cse1 .cse1) .cse3 (bvneg (bvmul (bvmul .cse2 .cse1) |c_ULTIMATE.start_main_~az~0#1|)))))))) is different from false [2023-12-25 03:19:09,636 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse5 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (let ((.cse4 (bvadd .cse0 .cse5)) (.cse3 (bvmul .cse0 .cse1)) (.cse2 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1))) (or (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse2 |c_ULTIMATE.start_main_~az~0#1|)) .cse3 (bvneg .cse4)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse5 (bvneg (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~az~0#1|))))) (= (_ bv0 64) (bvadd .cse0 (bvneg (bvadd .cse0 (bvmul .cse4 .cse1))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) (bvmul .cse0 .cse1 .cse1) .cse3 (bvneg (bvmul (bvmul .cse2 .cse1) |c_ULTIMATE.start_main_~az~0#1|)))))))) is different from true [2023-12-25 03:19:22,234 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:19:29,116 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:19:34,663 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:19:38,809 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_19|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| .cse2)) (.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvadd .cse0 .cse1)) (.cse5 (bvmul .cse1 .cse2)) (.cse4 (bvmul .cse2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|))) (or (= (bvadd .cse0 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) .cse1) (_ bv0 64)) (= (_ bv0 64) (bvadd (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| .cse2 .cse2 .cse2) (bvneg (bvadd (bvmul .cse3 .cse2) .cse1)) (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| (bvmul .cse4 .cse2))) .cse1 .cse5 (bvmul .cse1 .cse2 .cse2))) (not (= (bvadd (bvneg .cse3) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| .cse2 .cse2) .cse1 .cse5 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| .cse4))) (_ bv0 64)))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:19:51,449 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:19:56,742 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:20:01,831 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:20:14,528 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:20:20,523 WARN L293 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:20:28,988 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:20:33,163 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_19|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| .cse2)) (.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvadd .cse0 .cse1)) (.cse5 (bvmul .cse1 .cse2)) (.cse4 (bvmul .cse2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|))) (or (= (bvadd .cse0 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) .cse1) (_ bv0 64)) (= (_ bv0 64) (bvadd (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| .cse2 .cse2 .cse2) (bvneg (bvadd (bvmul .cse3 .cse2) .cse1)) (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| (bvmul .cse4 .cse2))) .cse1 .cse5 (bvmul .cse1 .cse2 .cse2))) (not (= (bvadd (bvneg .cse3) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| .cse2 .cse2) .cse1 .cse5 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| .cse4))) (_ bv0 64)))))))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:20:41,664 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:20:50,091 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:21:03,451 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:21:12,086 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:21:20,751 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:21:24,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1)) (.cse7 (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (let ((.cse4 (bvadd .cse0 (bvmul .cse7 .cse1))) (.cse2 (bvmul .cse0 .cse1 .cse1)) (.cse3 (bvmul .cse0 .cse1)) (.cse5 (bvmul .cse6 .cse1))) (or (= (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1) .cse2 (bvmul .cse0 .cse1 .cse1 .cse1) .cse3 (bvneg (bvadd .cse0 (bvmul .cse1 .cse4))) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| (bvmul .cse5 .cse1)))) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse6 |c_ULTIMATE.start_main_~az~0#1|)) .cse3 (bvneg .cse7)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg .cse4) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) .cse2 .cse3 (bvneg (bvmul .cse5 |c_ULTIMATE.start_main_~az~0#1|))))))))) is different from false [2023-12-25 03:21:29,121 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1)) (.cse7 (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (let ((.cse4 (bvadd .cse0 (bvmul .cse7 .cse1))) (.cse2 (bvmul .cse0 .cse1 .cse1)) (.cse3 (bvmul .cse0 .cse1)) (.cse5 (bvmul .cse6 .cse1))) (or (= (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1) .cse2 (bvmul .cse0 .cse1 .cse1 .cse1) .cse3 (bvneg (bvadd .cse0 (bvmul .cse1 .cse4))) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| (bvmul .cse5 .cse1)))) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse6 |c_ULTIMATE.start_main_~az~0#1|)) .cse3 (bvneg .cse7)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg .cse4) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) .cse2 .cse3 (bvneg (bvmul .cse5 |c_ULTIMATE.start_main_~az~0#1|))))))))) is different from true [2023-12-25 03:21:38,091 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:21:46,836 WARN L293 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:21:55,651 WARN L293 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:22:04,370 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:22:08,548 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse8 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (let ((.cse6 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1)) (.cse7 (bvadd .cse0 .cse8))) (let ((.cse4 (bvadd .cse0 (bvmul .cse7 .cse1))) (.cse2 (bvmul .cse0 .cse1 .cse1)) (.cse3 (bvmul .cse0 .cse1)) (.cse5 (bvmul .cse6 .cse1))) (or (= (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1) .cse2 (bvmul .cse0 .cse1 .cse1 .cse1) .cse3 (bvneg (bvadd .cse0 (bvmul .cse1 .cse4))) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| (bvmul .cse5 .cse1)))) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse6 |c_ULTIMATE.start_main_~az~0#1|)) .cse3 (bvneg .cse7)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse8 (bvneg (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~az~0#1|))))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg .cse4) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) .cse2 .cse3 (bvneg (bvmul .cse5 |c_ULTIMATE.start_main_~az~0#1|)))))))))) is different from false [2023-12-25 03:22:12,733 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse8 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (let ((.cse6 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1)) (.cse7 (bvadd .cse0 .cse8))) (let ((.cse4 (bvadd .cse0 (bvmul .cse7 .cse1))) (.cse2 (bvmul .cse0 .cse1 .cse1)) (.cse3 (bvmul .cse0 .cse1)) (.cse5 (bvmul .cse6 .cse1))) (or (= (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1) .cse2 (bvmul .cse0 .cse1 .cse1 .cse1) .cse3 (bvneg (bvadd .cse0 (bvmul .cse1 .cse4))) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| (bvmul .cse5 .cse1)))) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse6 |c_ULTIMATE.start_main_~az~0#1|)) .cse3 (bvneg .cse7)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse8 (bvneg (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~az~0#1|))))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg .cse4) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) .cse2 .cse3 (bvneg (bvmul .cse5 |c_ULTIMATE.start_main_~az~0#1|)))))))))) is different from true [2023-12-25 03:22:25,642 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:22:34,261 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:22:39,739 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:22:48,563 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:22:52,805 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse5 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_20|))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_17|)) (.cse1 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5))) (let ((.cse7 (bvadd .cse0 .cse1)) (.cse8 (bvmul |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| .cse5))) (let ((.cse2 (bvmul .cse8 .cse5)) (.cse4 (bvmul .cse0 .cse5 .cse5)) (.cse6 (bvadd (bvmul .cse7 .cse5) .cse0)) (.cse3 (bvmul .cse0 .cse5))) (or (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) .cse0 .cse1 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12|)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| .cse2)) .cse3 .cse4 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5 .cse5 .cse5) (bvneg .cse6)))) (= (_ bv0 64) (bvadd (bvmul .cse0 .cse5 .cse5 .cse5) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5 .cse5 .cse5 .cse5) (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| (bvmul .cse2 .cse5))) .cse0 .cse3 .cse4 (bvneg (bvadd .cse0 (bvmul .cse6 .cse5))))) (not (= (_ bv0 64) (bvadd (bvneg .cse7) .cse0 .cse3 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| .cse8)) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5 .cse5))))))))))) is different from true [2023-12-25 03:23:05,799 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:23:14,551 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:23:23,242 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:23:32,060 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:23:45,081 WARN L293 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:23:53,792 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:24:02,446 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:24:11,116 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:24:15,326 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse5 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_20|))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_17|)) (.cse1 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5))) (let ((.cse7 (bvadd .cse0 .cse1)) (.cse8 (bvmul |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| .cse5))) (let ((.cse2 (bvmul .cse8 .cse5)) (.cse4 (bvmul .cse0 .cse5 .cse5)) (.cse6 (bvadd (bvmul .cse7 .cse5) .cse0)) (.cse3 (bvmul .cse0 .cse5))) (or (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) .cse0 .cse1 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12|)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| .cse2)) .cse3 .cse4 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5 .cse5 .cse5) (bvneg .cse6)))) (= (_ bv0 64) (bvadd (bvmul .cse0 .cse5 .cse5 .cse5) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5 .cse5 .cse5 .cse5) (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| (bvmul .cse2 .cse5))) .cse0 .cse3 .cse4 (bvneg (bvadd .cse0 (bvmul .cse6 .cse5))))) (not (= (_ bv0 64) (bvadd (bvneg .cse7) .cse0 .cse3 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_12| .cse8)) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| .cse5 .cse5))))))))))) is different from true [2023-12-25 03:24:21,055 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:24:29,824 WARN L293 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:24:38,630 WARN L293 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:24:47,364 WARN L293 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:24:56,390 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:25:05,019 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:25:14,027 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:25:23,054 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:25:30,037 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse8 (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (.cse7 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1))) (let ((.cse10 (bvmul .cse7 .cse1)) (.cse9 (bvadd .cse0 (bvmul .cse8 .cse1)))) (let ((.cse4 (bvmul .cse0 .cse1 .cse1 .cse1)) (.cse6 (bvadd .cse0 (bvmul .cse1 .cse9))) (.cse2 (bvmul .cse10 .cse1)) (.cse3 (bvmul .cse0 .cse1 .cse1)) (.cse5 (bvmul .cse0 .cse1))) (or (= (_ bv0 64) (bvadd .cse0 (bvmul .cse0 .cse1 .cse1 .cse1 .cse1) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| (bvmul .cse1 .cse2))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1 .cse1) .cse3 .cse4 .cse5 (bvneg (bvadd .cse0 (bvmul .cse1 .cse6))))) (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse7 |c_ULTIMATE.start_main_~az~0#1|)) .cse5 (bvneg .cse8)))) (not (= (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1) .cse3 .cse4 .cse5 (bvneg .cse6) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| .cse2))) (_ bv0 64))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg .cse9) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) .cse3 .cse5 (bvneg (bvmul .cse10 |c_ULTIMATE.start_main_~az~0#1|)))))))))) is different from true [2023-12-25 03:25:43,557 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:25:52,623 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:26:01,618 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:26:10,726 WARN L293 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:26:19,869 WARN L293 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:26:24,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse9 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (let ((.cse8 (bvadd .cse0 .cse9)) (.cse7 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1))) (let ((.cse11 (bvmul .cse7 .cse1)) (.cse10 (bvadd .cse0 (bvmul .cse8 .cse1)))) (let ((.cse4 (bvmul .cse0 .cse1 .cse1 .cse1)) (.cse6 (bvadd .cse0 (bvmul .cse1 .cse10))) (.cse2 (bvmul .cse11 .cse1)) (.cse3 (bvmul .cse0 .cse1 .cse1)) (.cse5 (bvmul .cse0 .cse1))) (or (= (_ bv0 64) (bvadd .cse0 (bvmul .cse0 .cse1 .cse1 .cse1 .cse1) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| (bvmul .cse1 .cse2))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1 .cse1) .cse3 .cse4 .cse5 (bvneg (bvadd .cse0 (bvmul .cse1 .cse6))))) (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse7 |c_ULTIMATE.start_main_~az~0#1|)) .cse5 (bvneg .cse8)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse9 (bvneg (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~az~0#1|))))) (not (= (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1) .cse3 .cse4 .cse5 (bvneg .cse6) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| .cse2))) (_ bv0 64))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg .cse10) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) .cse3 .cse5 (bvneg (bvmul .cse11 |c_ULTIMATE.start_main_~az~0#1|))))))))))) is different from false [2023-12-25 03:26:28,496 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse9 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (let ((.cse8 (bvadd .cse0 .cse9)) (.cse7 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1))) (let ((.cse11 (bvmul .cse7 .cse1)) (.cse10 (bvadd .cse0 (bvmul .cse8 .cse1)))) (let ((.cse4 (bvmul .cse0 .cse1 .cse1 .cse1)) (.cse6 (bvadd .cse0 (bvmul .cse1 .cse10))) (.cse2 (bvmul .cse11 .cse1)) (.cse3 (bvmul .cse0 .cse1 .cse1)) (.cse5 (bvmul .cse0 .cse1))) (or (= (_ bv0 64) (bvadd .cse0 (bvmul .cse0 .cse1 .cse1 .cse1 .cse1) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| (bvmul .cse1 .cse2))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1 .cse1) .cse3 .cse4 .cse5 (bvneg (bvadd .cse0 (bvmul .cse1 .cse6))))) (not (= (_ bv0 64) (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) (bvneg (bvmul .cse7 |c_ULTIMATE.start_main_~az~0#1|)) .cse5 (bvneg .cse8)))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse9 (bvneg (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~az~0#1|))))) (not (= (bvadd .cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1 .cse1) .cse3 .cse4 .cse5 (bvneg .cse6) (bvneg (bvmul |c_ULTIMATE.start_main_~az~0#1| .cse2))) (_ bv0 64))) (not (= (_ bv0 64) (bvadd .cse0 (bvneg .cse10) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) .cse3 .cse5 (bvneg (bvmul .cse11 |c_ULTIMATE.start_main_~az~0#1|))))))))))) is different from true [2023-12-25 03:26:41,903 WARN L293 SmtUtils]: Spent 9.19s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:26:50,827 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:26:58,325 WARN L293 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:27:07,506 WARN L293 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:27:16,448 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:27:20,719 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_13| (_ BitVec 64))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_21|))) (let ((.cse11 (bvmul .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|)) (.cse4 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_18|))) (let ((.cse2 (bvadd .cse11 .cse4)) (.cse3 (bvmul .cse0 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_13|))) (let ((.cse5 (bvmul .cse0 .cse3)) (.cse7 (bvadd (bvmul .cse0 .cse2) .cse4))) (let ((.cse1 (bvmul .cse0 .cse4)) (.cse10 (bvadd (bvmul .cse0 .cse7) .cse4)) (.cse8 (bvmul .cse0 .cse0 .cse0 .cse4)) (.cse9 (bvmul .cse0 .cse5)) (.cse6 (bvmul .cse0 .cse0 .cse4))) (or (not (= (_ bv0 64) (bvadd (bvmul .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|) .cse1 (bvneg .cse2) (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_13| .cse3)) .cse4))) (not (= (_ bv0 64) (bvadd (bvmul .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|) .cse1 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_13| .cse5)) .cse4 .cse6 (bvneg .cse7)))) (= (_ bv0 64) (bvadd .cse1 (bvmul .cse0 .cse0 .cse0 .cse0 .cse4) .cse8 (bvneg (bvmul (bvmul .cse0 .cse9) |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_13|)) (bvneg (bvadd (bvmul .cse0 .cse10) .cse4)) .cse4 .cse6 (bvmul .cse0 .cse0 .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|) .cse11 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_13| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_13|)) .cse4)) (not (= (_ bv0 64) (bvadd .cse1 (bvneg .cse10) .cse8 (bvneg (bvmul |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_13| .cse9)) .cse4 .cse6 (bvmul .cse0 .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))))))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true Received shutdown request... [2023-12-25 03:27:24,354 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 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 03:27:24,354 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 03:27:24,939 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:27:24,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 03:27:25,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:25,140 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. [2023-12-25 03:27:25,143 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-12-25 03:27:25,145 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:27:25,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:27:25 BoogieIcfgContainer [2023-12-25 03:27:25,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:27:25,146 INFO L158 Benchmark]: Toolchain (without parser) took 887706.76ms. Allocated memory is still 318.8MB. Free memory was 276.1MB in the beginning and 116.9MB in the end (delta: 159.2MB). Peak memory consumption was 160.4MB. Max. memory is 8.0GB. [2023-12-25 03:27:25,146 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:27:25,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.40ms. Allocated memory is still 318.8MB. Free memory was 275.6MB in the beginning and 264.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 03:27:25,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.35ms. Allocated memory is still 318.8MB. Free memory was 264.0MB in the beginning and 262.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:27:25,147 INFO L158 Benchmark]: Boogie Preprocessor took 23.36ms. Allocated memory is still 318.8MB. Free memory was 262.9MB in the beginning and 260.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:27:25,147 INFO L158 Benchmark]: RCFGBuilder took 486.55ms. Allocated memory is still 318.8MB. Free memory was 260.9MB in the beginning and 247.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 03:27:25,147 INFO L158 Benchmark]: TraceAbstraction took 886990.55ms. Allocated memory is still 318.8MB. Free memory was 247.3MB in the beginning and 116.9MB in the end (delta: 130.3MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. [2023-12-25 03:27:25,148 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.40ms. Allocated memory is still 318.8MB. Free memory was 275.6MB in the beginning and 264.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.35ms. Allocated memory is still 318.8MB. Free memory was 264.0MB in the beginning and 262.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.36ms. Allocated memory is still 318.8MB. Free memory was 262.9MB in the beginning and 260.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 486.55ms. Allocated memory is still 318.8MB. Free memory was 260.9MB in the beginning and 247.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 886990.55ms. Allocated memory is still 318.8MB. Free memory was 247.3MB in the beginning and 116.9MB in the end (delta: 130.3MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.9s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 89.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 47.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 46.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 59 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 76.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 48.5s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 619 SizeOfPredicates, 6 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 52/68 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