/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_fillercode_fillercodestructure_filler-ps-ci_file-29.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 12:37:17,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 12:37:17,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 12:37:17,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 12:37:17,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 12:37:17,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 12:37:17,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 12:37:17,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 12:37:17,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 12:37:17,234 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 12:37:17,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 12:37:17,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 12:37:17,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 12:37:17,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 12:37:17,236 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 12:37:17,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 12:37:17,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 12:37:17,237 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 12:37:17,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 12:37:17,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 12:37:17,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 12:37:17,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 12:37:17,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 12:37:17,238 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 12:37:17,238 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 12:37:17,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 12:37:17,238 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 12:37:17,239 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 12:37:17,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 12:37:17,239 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 12:37:17,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 12:37:17,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 12:37:17,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 12:37:17,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 12:37:17,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:37:17,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 12:37:17,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 12:37:17,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 12:37:17,241 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 12:37:17,241 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 12:37:17,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 12:37:17,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 12:37:17,241 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 12:37:17,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 12:37:17,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 12:37:17,242 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 12:37:17,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 12:37:17,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 12:37:17,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 12:37:17,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 12:37:17,466 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 12:37:17,467 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 12:37:17,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2023-12-16 12:37:18,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 12:37:18,721 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 12:37:18,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2023-12-16 12:37:18,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b333af1e0/6ac3019ca43f4854bd302d76b36626fb/FLAGc115550f0 [2023-12-16 12:37:18,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b333af1e0/6ac3019ca43f4854bd302d76b36626fb [2023-12-16 12:37:18,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 12:37:18,749 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 12:37:18,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 12:37:18,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 12:37:18,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 12:37:18,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:37:18" (1/1) ... [2023-12-16 12:37:18,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b18505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:18, skipping insertion in model container [2023-12-16 12:37:18,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:37:18" (1/1) ... [2023-12-16 12:37:18,782 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 12:37:18,881 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_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2023-12-16 12:37:18,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:37:18,949 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 12:37:18,971 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_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2023-12-16 12:37:19,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:37:19,062 INFO L206 MainTranslator]: Completed translation [2023-12-16 12:37:19,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19 WrapperNode [2023-12-16 12:37:19,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 12:37:19,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 12:37:19,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 12:37:19,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 12:37:19,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,136 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2023-12-16 12:37:19,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 12:37:19,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 12:37:19,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 12:37:19,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 12:37:19,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,178 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-16 12:37:19,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 12:37:19,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 12:37:19,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 12:37:19,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 12:37:19,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (1/1) ... [2023-12-16 12:37:19,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:37:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 12:37:19,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 12:37:19,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 12:37:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 12:37:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 12:37:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 12:37:19,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 12:37:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 12:37:19,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 12:37:19,404 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 12:37:19,410 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 12:37:21,843 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 12:37:21,871 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 12:37:21,871 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 12:37:21,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:37:21 BoogieIcfgContainer [2023-12-16 12:37:21,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 12:37:21,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 12:37:21,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 12:37:21,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 12:37:21,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:37:18" (1/3) ... [2023-12-16 12:37:21,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbe49f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:37:21, skipping insertion in model container [2023-12-16 12:37:21,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:37:19" (2/3) ... [2023-12-16 12:37:21,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbe49f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:37:21, skipping insertion in model container [2023-12-16 12:37:21,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:37:21" (3/3) ... [2023-12-16 12:37:21,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2023-12-16 12:37:21,888 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 12:37:21,889 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 12:37:21,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 12:37:21,922 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;@3f52cd97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 12:37:21,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 12:37:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 12:37:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-16 12:37:21,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:37:21,936 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 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, 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-16 12:37:21,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:37:21,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:37:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash 120875218, now seen corresponding path program 1 times [2023-12-16 12:37:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:37:21,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680523323] [2023-12-16 12:37:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:37:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:37:21,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:37:21,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:37:21,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 12:37:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:37:22,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 12:37:22,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:37:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2023-12-16 12:37:22,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:37:22,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:37:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680523323] [2023-12-16 12:37:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680523323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:37:22,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:37:22,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 12:37:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702409819] [2023-12-16 12:37:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:37:22,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 12:37:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:37:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 12:37:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 12:37:22,503 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-16 12:37:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:37:23,451 INFO L93 Difference]: Finished difference Result 155 states and 286 transitions. [2023-12-16 12:37:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 12:37:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2023-12-16 12:37:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:37:23,484 INFO L225 Difference]: With dead ends: 155 [2023-12-16 12:37:23,484 INFO L226 Difference]: Without dead ends: 77 [2023-12-16 12:37:23,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-16 12:37:23,492 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 12:37:23,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 12:37:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-16 12:37:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-16 12:37:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 12:37:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2023-12-16 12:37:23,551 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 173 [2023-12-16 12:37:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:37:23,551 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2023-12-16 12:37:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-16 12:37:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2023-12-16 12:37:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-16 12:37:23,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:37:23,560 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 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, 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-16 12:37:23,571 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-16 12:37:23,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:37:23,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:37:23,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:37:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash -255281906, now seen corresponding path program 1 times [2023-12-16 12:37:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:37:23,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195625682] [2023-12-16 12:37:23,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:37:23,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:37:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:37:23,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:37:23,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 12:37:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:37:24,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:37:24,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:37:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-12-16 12:37:24,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:37:24,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:37:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195625682] [2023-12-16 12:37:24,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195625682] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 12:37:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737172797] [2023-12-16 12:37:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:37:24,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 12:37:24,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 12:37:24,457 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-16 12:37:24,472 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-16 12:37:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:37:24,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 12:37:24,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:37:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-12-16 12:37:25,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:37:25,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [737172797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:37:25,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 12:37:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-12-16 12:37:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392869725] [2023-12-16 12:37:25,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:37:25,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 12:37:25,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:37:25,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 12:37:25,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:37:25,193 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-16 12:37:26,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:37:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:37:26,567 INFO L93 Difference]: Finished difference Result 229 states and 370 transitions. [2023-12-16 12:37:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 12:37:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2023-12-16 12:37:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:37:26,572 INFO L225 Difference]: With dead ends: 229 [2023-12-16 12:37:26,572 INFO L226 Difference]: Without dead ends: 153 [2023-12-16 12:37:26,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:37:26,573 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 35 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 12:37:26,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 238 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 12:37:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-16 12:37:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2023-12-16 12:37:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 12:37:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 245 transitions. [2023-12-16 12:37:26,600 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 245 transitions. Word has length 173 [2023-12-16 12:37:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:37:26,605 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 245 transitions. [2023-12-16 12:37:26,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-16 12:37:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2023-12-16 12:37:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-16 12:37:26,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:37:26,608 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 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, 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-16 12:37:26,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-12-16 12:37:26,825 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-16 12:37:27,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:37:27,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:37:27,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:37:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash -253434864, now seen corresponding path program 1 times [2023-12-16 12:37:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:37:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579553715] [2023-12-16 12:37:27,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:37:27,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:37:27,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:37:27,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:37:27,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 12:37:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:37:27,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:37:27,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:37:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-12-16 12:37:27,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:37:27,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:37:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579553715] [2023-12-16 12:37:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579553715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 12:37:27,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1810620924] [2023-12-16 12:37:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:37:27,522 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 12:37:27,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 12:37:27,532 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 12:37:27,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-16 12:37:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:37:28,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 12:37:28,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:37:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-12-16 12:37:29,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:37:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-12-16 12:37:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1810620924] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 12:37:29,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 12:37:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-12-16 12:37:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940842256] [2023-12-16 12:37:29,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 12:37:29,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 12:37:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:37:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 12:37:29,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-16 12:37:29,372 INFO L87 Difference]: Start difference. First operand 151 states and 245 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2023-12-16 12:37:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:37:42,991 INFO L93 Difference]: Finished difference Result 657 states and 1017 transitions. [2023-12-16 12:37:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-16 12:37:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 173 [2023-12-16 12:37:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:37:42,996 INFO L225 Difference]: With dead ends: 657 [2023-12-16 12:37:42,996 INFO L226 Difference]: Without dead ends: 507 [2023-12-16 12:37:42,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 12:37:42,999 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 401 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-12-16 12:37:42,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 424 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2023-12-16 12:37:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2023-12-16 12:37:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 327. [2023-12-16 12:37:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 202 states have internal predecessors, (272), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2023-12-16 12:37:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 496 transitions. [2023-12-16 12:37:43,088 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 496 transitions. Word has length 173 [2023-12-16 12:37:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:37:43,090 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 496 transitions. [2023-12-16 12:37:43,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2023-12-16 12:37:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 496 transitions. [2023-12-16 12:37:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-16 12:37:43,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:37:43,092 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 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, 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-16 12:37:43,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 12:37:43,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-16 12:37:43,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 12:37:43,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:37:43,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:37:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1554730517, now seen corresponding path program 1 times [2023-12-16 12:37:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:37:43,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682493824] [2023-12-16 12:37:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:37:43,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:37:43,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:37:43,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:37:43,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 12:37:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:37:43,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 12:37:43,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:37:59,111 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse5 (fp.neg .cse0)) (.cse4 (fp.neg .cse2))) (let ((.cse3 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4)))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (not (fp.lt .cse1 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse5))))))) is different from true [2023-12-16 12:38:07,070 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0)))) (.cse1 (fp.neg .cse3)) (.cse0 (fp.neg .cse2))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.geq ~var_1_24~0 .cse3) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse3) (not (fp.lt .cse4 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0)))))))) is different from true [2023-12-16 12:38:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-12-16 12:38:13,123 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:38:13,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:38:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682493824] [2023-12-16 12:38:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682493824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:38:13,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:38:13,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 12:38:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211536462] [2023-12-16 12:38:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:38:13,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 12:38:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:38:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 12:38:13,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=111, Unknown=2, NotChecked=46, Total=210 [2023-12-16 12:38:13,125 INFO L87 Difference]: Start difference. First operand 327 states and 496 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Received shutdown request... [2023-12-16 12:38:34,736 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:38:34,748 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-16 12:38:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 12:38:34,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=126, Invalid=260, Unknown=2, NotChecked=74, Total=462 [2023-12-16 12:38:34,959 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 128 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 12:38:34,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 158 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 213 Invalid, 0 Unknown, 247 Unchecked, 1.2s Time] [2023-12-16 12:38:34,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 12:38:34,972 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 (7)] Ended with exit code 0 [2023-12-16 12:38:35,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:38:35,174 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (327states) and FLOYD_HOARE automaton (currently 16 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-12-2-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ∧-2-1 context. [2023-12-16 12:38:35,177 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-16 12:38:35,179 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 12:38:35,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:38:35 BoogieIcfgContainer [2023-12-16 12:38:35,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 12:38:35,181 INFO L158 Benchmark]: Toolchain (without parser) took 76432.68ms. Allocated memory was 269.5MB in the beginning and 324.0MB in the end (delta: 54.5MB). Free memory was 215.4MB in the beginning and 262.4MB in the end (delta: -47.0MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2023-12-16 12:38:35,181 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 141.1MB in the beginning and 141.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 12:38:35,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.56ms. Allocated memory is still 269.5MB. Free memory was 214.9MB in the beginning and 199.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 12:38:35,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.40ms. Allocated memory is still 269.5MB. Free memory was 199.1MB in the beginning and 196.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 12:38:35,182 INFO L158 Benchmark]: Boogie Preprocessor took 58.84ms. Allocated memory is still 269.5MB. Free memory was 196.5MB in the beginning and 192.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 12:38:35,182 INFO L158 Benchmark]: RCFGBuilder took 2675.38ms. Allocated memory is still 269.5MB. Free memory was 192.8MB in the beginning and 229.3MB in the end (delta: -36.5MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2023-12-16 12:38:35,182 INFO L158 Benchmark]: TraceAbstraction took 73307.82ms. Allocated memory was 269.5MB in the beginning and 324.0MB in the end (delta: 54.5MB). Free memory was 228.4MB in the beginning and 262.4MB in the end (delta: -33.9MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. [2023-12-16 12:38:35,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 141.1MB in the beginning and 141.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 313.56ms. Allocated memory is still 269.5MB. Free memory was 214.9MB in the beginning and 199.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.40ms. Allocated memory is still 269.5MB. Free memory was 199.1MB in the beginning and 196.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.84ms. Allocated memory is still 269.5MB. Free memory was 196.5MB in the beginning and 192.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 2675.38ms. Allocated memory is still 269.5MB. Free memory was 192.8MB in the beginning and 229.3MB in the end (delta: -36.5MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. * TraceAbstraction took 73307.82ms. Allocated memory was 269.5MB in the beginning and 324.0MB in the end (delta: 54.5MB). Free memory was 228.4MB in the beginning and 262.4MB in the end (delta: -33.9MB). Peak memory consumption was 20.6MB. 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 constructing difference of abstraction (327states) and FLOYD_HOARE automaton (currently 16 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-12-2-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ∧-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.3s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 941 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 247 IncrementalHoareTripleChecker+Unchecked, 541 mSDsCounter, 538 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 538 mSolverCounterUnsat, 400 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1280 GetRequests, 1216 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=3, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 182 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 31.1s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1205 ConstructedInterpolants, 19 QuantifiedInterpolants, 6117 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1717 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 10554/10584 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