/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/hardness-nfm22/hardness_operatoramount_amount25_file-69.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 08:46:10,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 08:46:10,866 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-24 08:46:10,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 08:46:10,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 08:46:10,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 08:46:10,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 08:46:10,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 08:46:10,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 08:46:10,889 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 08:46:10,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 08:46:10,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 08:46:10,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 08:46:10,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 08:46:10,891 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 08:46:10,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 08:46:10,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 08:46:10,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 08:46:10,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 08:46:10,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 08:46:10,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 08:46:10,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 08:46:10,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 08:46:10,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 08:46:10,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 08:46:10,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 08:46:10,894 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 08:46:10,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 08:46:10,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 08:46:10,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 08:46:10,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 08:46:10,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 08:46:10,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 08:46:10,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 08:46:10,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 08:46:10,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 08:46:10,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 08:46:10,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 08:46:10,896 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 08:46:10,896 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 08:46:10,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 08:46:10,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 08:46:10,897 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 08:46:10,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 08:46:10,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 08:46:10,897 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 08:46:10,897 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-24 08:46:11,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 08:46:11,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 08:46:11,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 08:46:11,113 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 08:46:11,113 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 08:46:11,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-69.i [2023-12-24 08:46:12,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 08:46:12,236 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 08:46:12,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-69.i [2023-12-24 08:46:12,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e105cfd1/be83ffcc2912448c88b1622b25a88afc/FLAG79da1929d [2023-12-24 08:46:12,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e105cfd1/be83ffcc2912448c88b1622b25a88afc [2023-12-24 08:46:12,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 08:46:12,254 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 08:46:12,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 08:46:12,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 08:46:12,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 08:46:12,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17040d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12, skipping insertion in model container [2023-12-24 08:46:12,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,283 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 08:46:12,365 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-69.i[915,928] [2023-12-24 08:46:12,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 08:46:12,396 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 08:46:12,403 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-69.i[915,928] [2023-12-24 08:46:12,425 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 08:46:12,436 INFO L206 MainTranslator]: Completed translation [2023-12-24 08:46:12,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12 WrapperNode [2023-12-24 08:46:12,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 08:46:12,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 08:46:12,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 08:46:12,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 08:46:12,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,462 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2023-12-24 08:46:12,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 08:46:12,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 08:46:12,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 08:46:12,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 08:46:12,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,480 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-24 08:46:12,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 08:46:12,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 08:46:12,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 08:46:12,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 08:46:12,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (1/1) ... [2023-12-24 08:46:12,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 08:46:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 08:46:12,517 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-24 08:46:12,520 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-24 08:46:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 08:46:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 08:46:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 08:46:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 08:46:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 08:46:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 08:46:12,591 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 08:46:12,593 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 08:46:23,150 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 08:46:23,171 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 08:46:23,171 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 08:46:23,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:46:23 BoogieIcfgContainer [2023-12-24 08:46:23,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 08:46:23,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 08:46:23,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 08:46:23,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 08:46:23,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:46:12" (1/3) ... [2023-12-24 08:46:23,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697a77e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:46:23, skipping insertion in model container [2023-12-24 08:46:23,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:46:12" (2/3) ... [2023-12-24 08:46:23,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697a77e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:46:23, skipping insertion in model container [2023-12-24 08:46:23,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:46:23" (3/3) ... [2023-12-24 08:46:23,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-69.i [2023-12-24 08:46:23,215 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 08:46:23,215 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 08:46:23,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 08:46:23,254 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;@69cb62f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 08:46:23,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 08:46:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 08:46:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-24 08:46:23,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 08:46:23,276 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 08:46:23,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 08:46:23,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 08:46:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash -501230320, now seen corresponding path program 1 times [2023-12-24 08:46:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 08:46:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446345301] [2023-12-24 08:46:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 08:46:23,292 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-24 08:46:23,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 08:46:23,312 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-24 08:46:23,328 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-24 08:46:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 08:46:23,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 08:46:23,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 08:46:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-12-24 08:46:23,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 08:46:23,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 08:46:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446345301] [2023-12-24 08:46:23,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446345301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 08:46:23,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 08:46:23,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 08:46:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079958951] [2023-12-24 08:46:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 08:46:23,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 08:46:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 08:46:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 08:46:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 08:46:23,844 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 08:46:28,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 08:46:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 08:46:28,159 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2023-12-24 08:46:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 08:46:28,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 97 [2023-12-24 08:46:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 08:46:28,285 INFO L225 Difference]: With dead ends: 83 [2023-12-24 08:46:28,285 INFO L226 Difference]: Without dead ends: 41 [2023-12-24 08:46:28,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-24 08:46:28,305 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-24 08:46:28,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-12-24 08:46:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-24 08:46:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-24 08:46:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 08:46:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-12-24 08:46:28,353 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 97 [2023-12-24 08:46:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 08:46:28,353 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-12-24 08:46:28,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 08:46:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-12-24 08:46:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-24 08:46:28,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 08:46:28,356 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 08:46:28,367 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-24 08:46:28,566 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-24 08:46:28,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 08:46:28,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 08:46:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1635684180, now seen corresponding path program 1 times [2023-12-24 08:46:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 08:46:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806401651] [2023-12-24 08:46:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 08:46:28,569 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-24 08:46:28,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 08:46:28,570 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-24 08:46:28,577 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-24 08:46:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 08:46:29,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 08:46:29,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 08:46:51,471 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:47:05,939 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:47:18,282 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:47:31,266 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:47:43,625 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:47:56,067 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:48:00,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))) (or (and (exists ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))) .cse0) (and .cse0 (exists ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))))) is different from false [2023-12-24 08:48:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 255 proven. 21 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-12-24 08:48:00,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 08:48:38,075 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:48:59,507 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:49:19,881 WARN L293 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:49:40,053 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:50:00,269 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:50:12,622 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:50:29,176 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:50:41,827 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:50:46,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse42 ((_ zero_extend 16) c_~var_1_17~0))) (let ((.cse30 ((_ sign_extend 16) c_~var_1_10~0)) (.cse46 ((_ sign_extend 16) c_~var_1_11~0)) (.cse39 (bvslt (bvmul .cse42 .cse42) .cse42))) (let ((.cse23 (not .cse39)) (.cse29 (bvuge (bvmul (bvor .cse30 .cse42) .cse46) (_ bv4294967286 32))) (.cse33 ((_ zero_extend 24) c_~var_1_13~0)) (.cse41 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse30 (bvneg .cse46)))))) (let ((.cse32 ((_ zero_extend 24) c_~var_1_12~0)) (.cse31 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse45 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= .cse45 .cse41)) (= .cse30 .cse45))))) (.cse13 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= .cse44 .cse41)) (not (= .cse30 .cse44)))))) (.cse35 (= ((_ sign_extend 16) c_~var_1_15~0) ((_ sign_extend 16) c_~var_1_16~0))) (.cse22 (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ~var_1_1~0) .cse41)))) (.cse37 (= ((_ zero_extend 24) c_~var_1_18~0) .cse33)) (.cse25 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse43 .cse41) (= .cse30 .cse43))))) (.cse34 (forall ((~var_1_1~0 (_ BitVec 16))) (= ((_ sign_extend 16) ~var_1_1~0) .cse41))) (.cse38 (= ((_ zero_extend 16) c_~var_1_11~0) .cse42)) (.cse36 (and .cse23 .cse29))) (let ((.cse2 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0)))) (.cse16 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (.cse5 (or .cse36 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse40 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse40 .cse41) (not (= .cse30 .cse40))))))) (.cse6 (or .cse34 .cse38)) (.cse8 (or .cse36 .cse25)) (.cse9 (or .cse34 .cse37)) (.cse3 (or .cse35 .cse22)) (.cse14 (or .cse39 .cse22)) (.cse7 (or .cse38 .cse22)) (.cse10 (or .cse22 .cse37)) (.cse15 (or .cse22 .cse29)) (.cse1 (and .cse38 .cse35 .cse37)) (.cse18 (not .cse35)) (.cse19 (not .cse38)) (.cse20 (not .cse37)) (.cse4 (or .cse13 .cse36)) (.cse12 (or .cse31 .cse36)) (.cse11 (or .cse34 .cse35)) (.cse17 (= .cse32 .cse33)) (.cse0 (= ((_ zero_extend 24) c_~var_1_14~0) .cse32))) (and (or (not .cse0) (and (or .cse1 (and (or .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (or (and .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11) .cse16) .cse17)) (or .cse18 .cse19 .cse20 (let ((.cse24 (forall ((~var_1_1~0 (_ BitVec 16))) (not (= .cse30 ((_ sign_extend 16) ~var_1_1~0)))))) (and (or (not .cse17) (let ((.cse21 (or .cse25 .cse23))) (and (or .cse2 (and .cse21 (or .cse22 .cse23))) (or .cse16 (and (or .cse24 .cse23) .cse21))))) (or (let ((.cse28 (not .cse29))) (let ((.cse27 (and .cse23 .cse28))) (let ((.cse26 (or .cse25 .cse27))) (and (or .cse2 (and .cse26 (or .cse22 .cse27) (or .cse24 .cse28))) (or (and .cse26 (or .cse22 .cse28) (or .cse24 .cse27)) .cse16))))) .cse17)))))) (or (and (or .cse2 (and (or .cse1 (and .cse5 .cse6 .cse8 .cse9 .cse11)) (or (and .cse3 .cse4 .cse7 .cse10 .cse12) .cse1) (or .cse18 .cse19 .cse20 (and (or .cse25 .cse29) .cse5)) (or .cse18 .cse19 .cse20 (and .cse4 (or .cse31 .cse29))))) (or .cse16 (and .cse5 .cse6 .cse8 .cse9 (or (and .cse13 .cse3 .cse14 .cse7 .cse10 .cse15) .cse1) (or .cse18 .cse19 .cse20 (and .cse4 .cse12)) .cse11)) .cse17) .cse0))))))) is different from false [2023-12-24 08:50:50,615 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse42 ((_ zero_extend 16) c_~var_1_17~0))) (let ((.cse30 ((_ sign_extend 16) c_~var_1_10~0)) (.cse46 ((_ sign_extend 16) c_~var_1_11~0)) (.cse39 (bvslt (bvmul .cse42 .cse42) .cse42))) (let ((.cse23 (not .cse39)) (.cse29 (bvuge (bvmul (bvor .cse30 .cse42) .cse46) (_ bv4294967286 32))) (.cse33 ((_ zero_extend 24) c_~var_1_13~0)) (.cse41 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse30 (bvneg .cse46)))))) (let ((.cse32 ((_ zero_extend 24) c_~var_1_12~0)) (.cse31 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse45 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= .cse45 .cse41)) (= .cse30 .cse45))))) (.cse13 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= .cse44 .cse41)) (not (= .cse30 .cse44)))))) (.cse35 (= ((_ sign_extend 16) c_~var_1_15~0) ((_ sign_extend 16) c_~var_1_16~0))) (.cse22 (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ~var_1_1~0) .cse41)))) (.cse37 (= ((_ zero_extend 24) c_~var_1_18~0) .cse33)) (.cse25 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse43 .cse41) (= .cse30 .cse43))))) (.cse34 (forall ((~var_1_1~0 (_ BitVec 16))) (= ((_ sign_extend 16) ~var_1_1~0) .cse41))) (.cse38 (= ((_ zero_extend 16) c_~var_1_11~0) .cse42)) (.cse36 (and .cse23 .cse29))) (let ((.cse2 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0)))) (.cse16 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (.cse5 (or .cse36 (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse40 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse40 .cse41) (not (= .cse30 .cse40))))))) (.cse6 (or .cse34 .cse38)) (.cse8 (or .cse36 .cse25)) (.cse9 (or .cse34 .cse37)) (.cse3 (or .cse35 .cse22)) (.cse14 (or .cse39 .cse22)) (.cse7 (or .cse38 .cse22)) (.cse10 (or .cse22 .cse37)) (.cse15 (or .cse22 .cse29)) (.cse1 (and .cse38 .cse35 .cse37)) (.cse18 (not .cse35)) (.cse19 (not .cse38)) (.cse20 (not .cse37)) (.cse4 (or .cse13 .cse36)) (.cse12 (or .cse31 .cse36)) (.cse11 (or .cse34 .cse35)) (.cse17 (= .cse32 .cse33)) (.cse0 (= ((_ zero_extend 24) c_~var_1_14~0) .cse32))) (and (or (not .cse0) (and (or .cse1 (and (or .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (or (and .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11) .cse16) .cse17)) (or .cse18 .cse19 .cse20 (let ((.cse24 (forall ((~var_1_1~0 (_ BitVec 16))) (not (= .cse30 ((_ sign_extend 16) ~var_1_1~0)))))) (and (or (not .cse17) (let ((.cse21 (or .cse25 .cse23))) (and (or .cse2 (and .cse21 (or .cse22 .cse23))) (or .cse16 (and (or .cse24 .cse23) .cse21))))) (or (let ((.cse28 (not .cse29))) (let ((.cse27 (and .cse23 .cse28))) (let ((.cse26 (or .cse25 .cse27))) (and (or .cse2 (and .cse26 (or .cse22 .cse27) (or .cse24 .cse28))) (or (and .cse26 (or .cse22 .cse28) (or .cse24 .cse27)) .cse16))))) .cse17)))))) (or (and (or .cse2 (and (or .cse1 (and .cse5 .cse6 .cse8 .cse9 .cse11)) (or (and .cse3 .cse4 .cse7 .cse10 .cse12) .cse1) (or .cse18 .cse19 .cse20 (and (or .cse25 .cse29) .cse5)) (or .cse18 .cse19 .cse20 (and .cse4 (or .cse31 .cse29))))) (or .cse16 (and .cse5 .cse6 .cse8 .cse9 (or (and .cse13 .cse3 .cse14 .cse7 .cse10 .cse15) .cse1) (or .cse18 .cse19 .cse20 (and .cse4 .cse12)) .cse11)) .cse17) .cse0))))))) is different from true [2023-12-24 08:51:03,283 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:51:16,338 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:51:29,971 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:51:42,825 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:51:50,840 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:52:00,291 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:52:12,777 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:52:25,204 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:52:35,600 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:52:44,558 WARN L293 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:53:06,549 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:53:19,458 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:53:32,363 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:53:46,661 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:54:00,394 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:54:15,769 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:54:24,067 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ zero_extend 16) c_~var_1_17~0))) (let ((.cse44 (bvslt (bvmul .cse5 .cse5) .cse5)) (.cse6 ((_ sign_extend 16) c_~var_1_11~0))) (let ((.cse10 (bvneg .cse6)) (.cse26 (not .cse44)) (.cse24 ((_ zero_extend 24) c_~var_1_13~0))) (let ((.cse13 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0)))) (.cse23 (forall ((~var_1_14~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_14~0) .cse24))) (.cse19 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (.cse9 (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse61 ((_ sign_extend 16) ~var_1_10~0)) (.cse60 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse60 .cse61) (bvuge (bvmul (bvor .cse5 .cse61) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse61))) .cse60)))) .cse26)) (.cse2 (= ((_ zero_extend 24) c_~var_1_18~0) .cse24)) (.cse27 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse59 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse59))) ((_ sign_extend 16) ~var_1_1~0))) (bvuge (bvmul (bvor .cse5 .cse59) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|))))) (.cse0 (= ((_ sign_extend 16) c_~var_1_15~0) ((_ sign_extend 16) c_~var_1_16~0))) (.cse1 (= ((_ zero_extend 16) c_~var_1_11~0) .cse5))) (and (or (not .cse0) (not .cse1) (not .cse2) (let ((.cse7 (or .cse27 .cse26)) (.cse14 (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse25 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse5 .cse25) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not (= ((_ sign_extend 16) ~var_1_1~0) .cse25))))) .cse26))) (and (or (let ((.cse8 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse22 (bvmul (bvor .cse5 .cse21) .cse6)) (.cse20 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse20 .cse21) (bvuge .cse22 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not (bvuge .cse22 (_ bv4294967286 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse21))) .cse20))))))) (and (or (and (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse4 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse3 (bvmul (bvor .cse5 .cse4) .cse6))) (or (bvuge .cse3 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ~var_1_1~0) .cse4))) (not (bvuge .cse3 (_ bv4294967286 32))))))) .cse7 .cse8 .cse9 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse11 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse12 (bvmul (bvor .cse5 .cse11) .cse6))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse11))) ((_ sign_extend 16) ~var_1_1~0))) (bvuge .cse12 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not (bvuge .cse12 (_ bv4294967286 32)))))))) .cse13) (or (and .cse14 .cse8 (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse15 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse16 (bvmul (bvor .cse5 .cse15) .cse6))) (or (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse15))) ((_ sign_extend 16) ~var_1_1~0)))) (bvuge .cse16 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not (bvuge .cse16 (_ bv4294967286 32))))))) .cse9 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse18 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse17 (bvmul (bvor .cse5 .cse18) .cse6))) (or (bvuge .cse17 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not (bvuge .cse17 (_ bv4294967286 32))) (not (= ((_ sign_extend 16) ~var_1_1~0) .cse18))))))) .cse19))) .cse23) (or (and (or .cse13 (and .cse7 .cse9)) (or .cse19 (and .cse14 .cse9))) (forall ((~var_1_14~0 (_ BitVec 8))) (not (= ((_ zero_extend 24) ~var_1_14~0) .cse24))))))) (or (and .cse1 .cse0 .cse2) (let ((.cse57 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse58 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse5 .cse58) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse58))) ((_ sign_extend 16) ~var_1_1~0))))))) (let ((.cse28 (or .cse57 .cse1)) (.cse32 (or .cse57 .cse0)) (.cse33 (or .cse27 .cse1)) (.cse38 (or .cse57 .cse2)) (.cse39 (or .cse27 .cse2)) (.cse40 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse55 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse54 (bvmul (bvor .cse5 .cse55) .cse6)) (.cse56 ((_ sign_extend 16) ~var_1_1~0))) (or (bvuge .cse54 (_ bv4294967286 32)) (bvuge .cse54 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse55))) .cse56) (not (= .cse56 .cse55))))))) (.cse41 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse52 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse53 (bvmul (bvor .cse5 .cse52) .cse6)) (.cse51 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse51 .cse52) (bvuge .cse53 (_ bv4294967286 32)) (bvuge .cse53 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse52))) .cse51)))))) (.cse42 (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse50 ((_ sign_extend 16) ~var_1_1~0)) (.cse49 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse5 .cse49) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse49))) .cse50) (not (= .cse50 .cse49))))) .cse26)) (.cse43 (or .cse27 .cse0))) (and (or .cse13 (and .cse28 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse29 ((_ sign_extend 16) ~var_1_1~0)) (.cse31 (bvmul (bvor .cse5 .cse30) .cse6))) (or (= .cse29 .cse30) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse30))) .cse29)) (bvuge .cse31 (_ bv4294967286 32)) (bvuge .cse31 |c_ULTIMATE.start_step_~stepLocal_1~0#1|))))) .cse32 .cse33 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse35 ((_ sign_extend 16) ~var_1_1~0)) (.cse34 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse34))) .cse35)) (bvuge (bvmul (bvor .cse5 .cse34) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not (= .cse35 .cse34))))) (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse36 ((_ sign_extend 16) ~var_1_1~0)) (.cse37 ((_ sign_extend 16) ~var_1_10~0))) (or (= .cse36 .cse37) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse37))) .cse36)) (bvuge (bvmul (bvor .cse5 .cse37) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|)))) .cse26) .cse38 .cse9 .cse39 .cse40 .cse41 .cse42 .cse43)) (or .cse23 (forall ((~var_1_10~0 (_ BitVec 16))) (bvuge (bvmul (bvor .cse5 ((_ sign_extend 16) ~var_1_10~0)) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|))) (or .cse19 (and (or .cse27 .cse44) .cse28 .cse32 .cse33 (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse45 ((_ sign_extend 16) ~var_1_10~0))) (or (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse46 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse45))) .cse46)) (not (= .cse46 .cse45))))) (bvuge (bvmul (bvor .cse5 .cse45) .cse6) |c_ULTIMATE.start_step_~stepLocal_1~0#1|)))) .cse38 .cse9 .cse39 .cse40 (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse47 ((_ sign_extend 16) ~var_1_10~0))) (let ((.cse48 (bvmul (bvor .cse5 .cse47) .cse6))) (or (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse10 .cse47))) ((_ sign_extend 16) ~var_1_1~0)))) (bvuge .cse48 (_ bv4294967286 32)) (bvuge .cse48 |c_ULTIMATE.start_step_~stepLocal_1~0#1|))))) .cse41 .cse42 .cse43))))))))))) is different from true [2023-12-24 08:54:55,291 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:55:07,692 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:55:33,185 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:55:48,812 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:56:04,685 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:56:20,551 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:56:28,300 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 16) c_~var_1_11~0)) (.cse34 ((_ zero_extend 24) c_~var_1_13~0)) (.cse1 ((_ zero_extend 16) c_~var_1_17~0))) (let ((.cse23 (= ((_ sign_extend 16) c_~var_1_15~0) ((_ sign_extend 16) c_~var_1_16~0))) (.cse25 (= ((_ zero_extend 16) c_~var_1_11~0) .cse1)) (.cse24 (= ((_ zero_extend 24) c_~var_1_18~0) .cse34)) (.cse0 (forall ((~var_1_14~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_14~0) .cse34))) (.cse3 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (.cse18 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0)))) (.cse7 (bvneg .cse2)) (.cse10 (bvslt (bvmul .cse1 .cse1) .cse1))) (and (or (let ((.cse11 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse32))) ((_ sign_extend 16) ~var_1_1~0))) (bvuge (bvmul (bvor .cse1 .cse32) .cse2) (_ bv4294967286 32)))))) (.cse26 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse31 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse31) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse31))) ((_ sign_extend 16) ~var_1_1~0))))))) (let ((.cse4 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 16) ~var_1_1~0)) (.cse29 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse29) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse29))) .cse30) (not (= .cse30 .cse29)))))) (.cse5 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse28 ((_ sign_extend 16) ~var_1_10~0)) (.cse27 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse27 .cse28) (bvuge (bvmul (bvor .cse1 .cse28) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse28))) .cse27))))) (.cse6 (or .cse26 .cse24)) (.cse9 (or .cse25 .cse26)) (.cse14 (or .cse26 .cse23)) (.cse15 (or .cse25 .cse11)) (.cse16 (or .cse11 .cse24)) (.cse17 (or .cse23 .cse11))) (and (or .cse0 (forall ((~var_1_10~0 (_ BitVec 16))) (bvuge (bvmul (bvor .cse1 ((_ sign_extend 16) ~var_1_10~0)) .cse2) (_ bv4294967286 32)))) (or .cse3 (and .cse4 .cse5 .cse6 (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 16) ~var_1_10~0))) (or (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse8))) ((_ sign_extend 16) ~var_1_1~0)))) (bvuge (bvmul (bvor .cse1 .cse8) .cse2) (_ bv4294967286 32))))) .cse9 (or .cse10 .cse11) (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse12 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse12) .cse2) (_ bv4294967286 32)) (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse12))) .cse13)) (not (= .cse13 .cse12)))))))) .cse14 .cse15 .cse16 .cse17)) (or .cse18 (and .cse4 .cse5 .cse6 .cse9 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 16) ~var_1_1~0)) (.cse19 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse19))) .cse20)) (not (= .cse20 .cse19))))) .cse14 .cse15 .cse16 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 16) ~var_1_1~0)) (.cse22 ((_ sign_extend 16) ~var_1_10~0))) (or (= .cse21 .cse22) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse22))) .cse21)) (bvuge (bvmul (bvor .cse1 .cse22) .cse2) (_ bv4294967286 32))))) .cse17))))) (and .cse25 .cse23 .cse24)) (or (not .cse23) (not .cse25) (not .cse24) (let ((.cse33 (let ((.cse35 (not .cse10))) (let ((.cse36 (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse38 ((_ sign_extend 16) ~var_1_10~0)) (.cse37 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse37 .cse38) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse38))) .cse37)))) .cse35))) (and (or (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ~var_1_1~0) ((_ sign_extend 16) ~var_1_10~0)))) .cse35) .cse36) .cse3) (or .cse18 (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 ((_ sign_extend 16) ~var_1_10~0)))) ((_ sign_extend 16) ~var_1_1~0)))) .cse35) .cse36))))))) (and (or .cse33 (forall ((~var_1_14~0 (_ BitVec 8))) (not (= ((_ zero_extend 24) ~var_1_14~0) .cse34)))) (or .cse0 .cse33))))))) is different from false [2023-12-24 08:56:32,559 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 16) c_~var_1_11~0)) (.cse34 ((_ zero_extend 24) c_~var_1_13~0)) (.cse1 ((_ zero_extend 16) c_~var_1_17~0))) (let ((.cse23 (= ((_ sign_extend 16) c_~var_1_15~0) ((_ sign_extend 16) c_~var_1_16~0))) (.cse25 (= ((_ zero_extend 16) c_~var_1_11~0) .cse1)) (.cse24 (= ((_ zero_extend 24) c_~var_1_18~0) .cse34)) (.cse0 (forall ((~var_1_14~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_14~0) .cse34))) (.cse3 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (.cse18 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0)))) (.cse7 (bvneg .cse2)) (.cse10 (bvslt (bvmul .cse1 .cse1) .cse1))) (and (or (let ((.cse11 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse32))) ((_ sign_extend 16) ~var_1_1~0))) (bvuge (bvmul (bvor .cse1 .cse32) .cse2) (_ bv4294967286 32)))))) (.cse26 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse31 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse31) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse31))) ((_ sign_extend 16) ~var_1_1~0))))))) (let ((.cse4 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 16) ~var_1_1~0)) (.cse29 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse29) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse29))) .cse30) (not (= .cse30 .cse29)))))) (.cse5 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse28 ((_ sign_extend 16) ~var_1_10~0)) (.cse27 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse27 .cse28) (bvuge (bvmul (bvor .cse1 .cse28) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse28))) .cse27))))) (.cse6 (or .cse26 .cse24)) (.cse9 (or .cse25 .cse26)) (.cse14 (or .cse26 .cse23)) (.cse15 (or .cse25 .cse11)) (.cse16 (or .cse11 .cse24)) (.cse17 (or .cse23 .cse11))) (and (or .cse0 (forall ((~var_1_10~0 (_ BitVec 16))) (bvuge (bvmul (bvor .cse1 ((_ sign_extend 16) ~var_1_10~0)) .cse2) (_ bv4294967286 32)))) (or .cse3 (and .cse4 .cse5 .cse6 (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 16) ~var_1_10~0))) (or (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse8))) ((_ sign_extend 16) ~var_1_1~0)))) (bvuge (bvmul (bvor .cse1 .cse8) .cse2) (_ bv4294967286 32))))) .cse9 (or .cse10 .cse11) (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse12 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse12) .cse2) (_ bv4294967286 32)) (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse12))) .cse13)) (not (= .cse13 .cse12)))))))) .cse14 .cse15 .cse16 .cse17)) (or .cse18 (and .cse4 .cse5 .cse6 .cse9 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 16) ~var_1_1~0)) (.cse19 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse19))) .cse20)) (not (= .cse20 .cse19))))) .cse14 .cse15 .cse16 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 16) ~var_1_1~0)) (.cse22 ((_ sign_extend 16) ~var_1_10~0))) (or (= .cse21 .cse22) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse22))) .cse21)) (bvuge (bvmul (bvor .cse1 .cse22) .cse2) (_ bv4294967286 32))))) .cse17))))) (and .cse25 .cse23 .cse24)) (or (not .cse23) (not .cse25) (not .cse24) (let ((.cse33 (let ((.cse35 (not .cse10))) (let ((.cse36 (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse38 ((_ sign_extend 16) ~var_1_10~0)) (.cse37 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse37 .cse38) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse38))) .cse37)))) .cse35))) (and (or (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ~var_1_1~0) ((_ sign_extend 16) ~var_1_10~0)))) .cse35) .cse36) .cse3) (or .cse18 (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 ((_ sign_extend 16) ~var_1_10~0)))) ((_ sign_extend 16) ~var_1_1~0)))) .cse35) .cse36))))))) (and (or .cse33 (forall ((~var_1_14~0 (_ BitVec 8))) (not (= ((_ zero_extend 24) ~var_1_14~0) .cse34)))) (or .cse0 .cse33))))))) is different from true [2023-12-24 08:56:45,330 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:56:57,821 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:57:10,665 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:57:21,561 WARN L293 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:57:34,277 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:58:07,929 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:58:12,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 16) c_~var_1_11~0)) (.cse34 ((_ zero_extend 24) c_~var_1_13~0)) (.cse1 ((_ zero_extend 16) c_~var_1_17~0))) (let ((.cse23 (= ((_ sign_extend 16) c_~var_1_15~0) ((_ sign_extend 16) c_~var_1_16~0))) (.cse25 (= ((_ zero_extend 16) c_~var_1_11~0) .cse1)) (.cse24 (= ((_ zero_extend 24) c_~var_1_18~0) .cse34)) (.cse0 (forall ((~var_1_14~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_14~0) .cse34))) (.cse3 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (.cse18 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0)))) (.cse7 (bvneg .cse2)) (.cse10 (bvslt (bvmul .cse1 .cse1) .cse1))) (and (or (let ((.cse11 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse32))) ((_ sign_extend 16) ~var_1_1~0))) (bvuge (bvmul (bvor .cse1 .cse32) .cse2) (_ bv4294967286 32)))))) (.cse26 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse31 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse31) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse31))) ((_ sign_extend 16) ~var_1_1~0))))))) (let ((.cse4 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 16) ~var_1_1~0)) (.cse29 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse29) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse29))) .cse30) (not (= .cse30 .cse29)))))) (.cse5 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse28 ((_ sign_extend 16) ~var_1_10~0)) (.cse27 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse27 .cse28) (bvuge (bvmul (bvor .cse1 .cse28) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse28))) .cse27))))) (.cse6 (or .cse26 .cse24)) (.cse9 (or .cse25 .cse26)) (.cse14 (or .cse26 .cse23)) (.cse15 (or .cse25 .cse11)) (.cse16 (or .cse11 .cse24)) (.cse17 (or .cse23 .cse11))) (and (or .cse0 (forall ((~var_1_10~0 (_ BitVec 16))) (bvuge (bvmul (bvor .cse1 ((_ sign_extend 16) ~var_1_10~0)) .cse2) (_ bv4294967286 32)))) (or .cse3 (and .cse4 .cse5 .cse6 (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 16) ~var_1_10~0))) (or (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse8))) ((_ sign_extend 16) ~var_1_1~0)))) (bvuge (bvmul (bvor .cse1 .cse8) .cse2) (_ bv4294967286 32))))) .cse9 (or .cse10 .cse11) (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse12 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse12) .cse2) (_ bv4294967286 32)) (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse12))) .cse13)) (not (= .cse13 .cse12)))))))) .cse14 .cse15 .cse16 .cse17)) (or .cse18 (and .cse4 .cse5 .cse6 .cse9 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 16) ~var_1_1~0)) (.cse19 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse19))) .cse20)) (not (= .cse20 .cse19))))) .cse14 .cse15 .cse16 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 16) ~var_1_1~0)) (.cse22 ((_ sign_extend 16) ~var_1_10~0))) (or (= .cse21 .cse22) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse22))) .cse21)) (bvuge (bvmul (bvor .cse1 .cse22) .cse2) (_ bv4294967286 32))))) .cse17))))) (and .cse25 .cse23 .cse24)) (or (not .cse23) (not .cse25) (not .cse24) (let ((.cse33 (let ((.cse35 (not .cse10))) (and (or .cse3 .cse35) (or .cse18 (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 ((_ sign_extend 16) ~var_1_10~0)))) ((_ sign_extend 16) ~var_1_1~0)))) .cse35) (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse37 ((_ sign_extend 16) ~var_1_10~0)) (.cse36 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse36 .cse37) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse37))) .cse36)))) .cse35))))))) (and (or .cse0 .cse33) (or .cse33 (forall ((~var_1_14~0 (_ BitVec 8))) (not (= ((_ zero_extend 24) ~var_1_14~0) .cse34)))))))))) is different from false [2023-12-24 08:58:16,371 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 16) c_~var_1_11~0)) (.cse34 ((_ zero_extend 24) c_~var_1_13~0)) (.cse1 ((_ zero_extend 16) c_~var_1_17~0))) (let ((.cse23 (= ((_ sign_extend 16) c_~var_1_15~0) ((_ sign_extend 16) c_~var_1_16~0))) (.cse25 (= ((_ zero_extend 16) c_~var_1_11~0) .cse1)) (.cse24 (= ((_ zero_extend 24) c_~var_1_18~0) .cse34)) (.cse0 (forall ((~var_1_14~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_14~0) .cse34))) (.cse3 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (.cse18 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0)))) (.cse7 (bvneg .cse2)) (.cse10 (bvslt (bvmul .cse1 .cse1) .cse1))) (and (or (let ((.cse11 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse32))) ((_ sign_extend 16) ~var_1_1~0))) (bvuge (bvmul (bvor .cse1 .cse32) .cse2) (_ bv4294967286 32)))))) (.cse26 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse31 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse31) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse31))) ((_ sign_extend 16) ~var_1_1~0))))))) (let ((.cse4 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 16) ~var_1_1~0)) (.cse29 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse29) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse29))) .cse30) (not (= .cse30 .cse29)))))) (.cse5 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse28 ((_ sign_extend 16) ~var_1_10~0)) (.cse27 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse27 .cse28) (bvuge (bvmul (bvor .cse1 .cse28) .cse2) (_ bv4294967286 32)) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse28))) .cse27))))) (.cse6 (or .cse26 .cse24)) (.cse9 (or .cse25 .cse26)) (.cse14 (or .cse26 .cse23)) (.cse15 (or .cse25 .cse11)) (.cse16 (or .cse11 .cse24)) (.cse17 (or .cse23 .cse11))) (and (or .cse0 (forall ((~var_1_10~0 (_ BitVec 16))) (bvuge (bvmul (bvor .cse1 ((_ sign_extend 16) ~var_1_10~0)) .cse2) (_ bv4294967286 32)))) (or .cse3 (and .cse4 .cse5 .cse6 (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 16) ~var_1_10~0))) (or (forall ((~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse8))) ((_ sign_extend 16) ~var_1_1~0)))) (bvuge (bvmul (bvor .cse1 .cse8) .cse2) (_ bv4294967286 32))))) .cse9 (or .cse10 .cse11) (forall ((~var_1_10~0 (_ BitVec 16))) (let ((.cse12 ((_ sign_extend 16) ~var_1_10~0))) (or (bvuge (bvmul (bvor .cse1 .cse12) .cse2) (_ bv4294967286 32)) (forall ((~var_1_1~0 (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 16) ~var_1_1~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse12))) .cse13)) (not (= .cse13 .cse12)))))))) .cse14 .cse15 .cse16 .cse17)) (or .cse18 (and .cse4 .cse5 .cse6 .cse9 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 16) ~var_1_1~0)) (.cse19 ((_ sign_extend 16) ~var_1_10~0))) (or (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse19))) .cse20)) (not (= .cse20 .cse19))))) .cse14 .cse15 .cse16 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 16) ~var_1_1~0)) (.cse22 ((_ sign_extend 16) ~var_1_10~0))) (or (= .cse21 .cse22) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse22))) .cse21)) (bvuge (bvmul (bvor .cse1 .cse22) .cse2) (_ bv4294967286 32))))) .cse17))))) (and .cse25 .cse23 .cse24)) (or (not .cse23) (not .cse25) (not .cse24) (let ((.cse33 (let ((.cse35 (not .cse10))) (and (or .cse3 .cse35) (or .cse18 (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 ((_ sign_extend 16) ~var_1_10~0)))) ((_ sign_extend 16) ~var_1_1~0)))) .cse35) (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse37 ((_ sign_extend 16) ~var_1_10~0)) (.cse36 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse36 .cse37) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse37))) .cse36)))) .cse35))))))) (and (or .cse0 .cse33) (or .cse33 (forall ((~var_1_14~0 (_ BitVec 8))) (not (= ((_ zero_extend 24) ~var_1_14~0) .cse34)))))))))) is different from true [2023-12-24 08:58:28,811 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:58:41,548 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:58:54,056 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:59:06,801 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:59:10,988 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (let ((.cse4 ((_ zero_extend 16) c_~var_1_11~0))) (bvslt (bvmul .cse4 .cse4) .cse4))))) (and (or .cse0 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (or (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))) (let ((.cse1 (bvneg ((_ sign_extend 16) c_~var_1_11~0)))) (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse1 ((_ sign_extend 16) ~var_1_10~0)))) ((_ sign_extend 16) ~var_1_1~0)))) .cse0) (or .cse0 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse3 ((_ sign_extend 16) ~var_1_10~0)) (.cse2 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse2 .cse3) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse1 .cse3))) .cse2)))))))))) is different from false [2023-12-24 08:59:15,239 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (not (let ((.cse4 ((_ zero_extend 16) c_~var_1_11~0))) (bvslt (bvmul .cse4 .cse4) .cse4))))) (and (or .cse0 (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (not (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))))) (or (forall ((~var_1_9~0 (_ FloatingPoint 8 24)) (~var_1_8~0 (_ FloatingPoint 8 24)) (currentRoundingMode RoundingMode) (~var_1_7~0 (_ FloatingPoint 8 24)) (~var_1_6~0 (_ FloatingPoint 8 24))) (fp.gt (fp.sub currentRoundingMode ~var_1_6~0 ((_ to_fp 8 24) currentRoundingMode (/ 1003.0 5.0))) (fp.div currentRoundingMode (fp.div currentRoundingMode ~var_1_7~0 ~var_1_8~0) ~var_1_9~0))) (let ((.cse1 (bvneg ((_ sign_extend 16) c_~var_1_11~0)))) (and (or (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse1 ((_ sign_extend 16) ~var_1_10~0)))) ((_ sign_extend 16) ~var_1_1~0)))) .cse0) (or .cse0 (forall ((~var_1_10~0 (_ BitVec 16)) (~var_1_1~0 (_ BitVec 16))) (let ((.cse3 ((_ sign_extend 16) ~var_1_10~0)) (.cse2 ((_ sign_extend 16) ~var_1_1~0))) (or (= .cse2 .cse3) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse1 .cse3))) .cse2)))))))))) is different from true [2023-12-24 08:59:27,673 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:59:40,451 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 08:59:40,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 08:59:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806401651] [2023-12-24 08:59:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806401651] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 08:59:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [298823239] [2023-12-24 08:59:40,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 08:59:40,564 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 08:59:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 08:59:40,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 08:59:40,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-24 08:59:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 08:59:41,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 08:59:41,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:00:06,728 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 09:00:22,344 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 09:00:34,779 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 09:00:47,856 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-24 09:00:54,803 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 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 09:00:54,804 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 09:00:54,804 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-24 09:00:55,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 09:00:55,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-12-24 09:00:56,026 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 09:00:56,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 09:00:56,094 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 98 with TraceHistMax 16,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-24 09:00:56,104 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-24 09:00:56,107 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 09:00:56,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 09:00:56,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:00:56 BoogieIcfgContainer [2023-12-24 09:00:56,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 09:00:56,144 INFO L158 Benchmark]: Toolchain (without parser) took 883877.44ms. Allocated memory was 182.5MB in the beginning and 878.7MB in the end (delta: 696.3MB). Free memory was 135.0MB in the beginning and 688.3MB in the end (delta: -553.3MB). Peak memory consumption was 507.9MB. Max. memory is 8.0GB. [2023-12-24 09:00:56,144 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 09:00:56,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.43ms. Allocated memory is still 182.5MB. Free memory was 134.6MB in the beginning and 121.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 09:00:56,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.39ms. Allocated memory is still 182.5MB. Free memory was 121.4MB in the beginning and 119.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 09:00:56,145 INFO L158 Benchmark]: Boogie Preprocessor took 29.71ms. Allocated memory is still 182.5MB. Free memory was 119.7MB in the beginning and 116.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 09:00:56,145 INFO L158 Benchmark]: RCFGBuilder took 10694.98ms. Allocated memory is still 182.5MB. Free memory was 116.8MB in the beginning and 99.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 09:00:56,146 INFO L158 Benchmark]: TraceAbstraction took 872940.62ms. Allocated memory was 182.5MB in the beginning and 878.7MB in the end (delta: 696.3MB). Free memory was 99.0MB in the beginning and 688.3MB in the end (delta: -589.3MB). Peak memory consumption was 472.3MB. Max. memory is 8.0GB. [2023-12-24 09:00:56,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.15ms. Allocated memory is still 182.5MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.43ms. Allocated memory is still 182.5MB. Free memory was 134.6MB in the beginning and 121.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.39ms. Allocated memory is still 182.5MB. Free memory was 121.4MB in the beginning and 119.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.71ms. Allocated memory is still 182.5MB. Free memory was 119.7MB in the beginning and 116.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 10694.98ms. Allocated memory is still 182.5MB. Free memory was 116.8MB in the beginning and 99.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 872940.62ms. Allocated memory was 182.5MB in the beginning and 878.7MB in the end (delta: 696.3MB). Free memory was 99.0MB in the beginning and 688.3MB in the end (delta: -589.3MB). Peak memory consumption was 472.3MB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 98 with TraceHistMax 16,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 872.9s, OverallIterations: 2, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 57 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 480/480 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