./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:45:21,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:45:21,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:45:21,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:45:21,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:45:21,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:45:21,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:45:21,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:45:21,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:45:21,570 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:45:21,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:45:21,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:45:21,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:45:21,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:45:21,573 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:45:21,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:45:21,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:45:21,574 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:45:21,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:45:21,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:45:21,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:45:21,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:45:21,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:45:21,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:45:21,575 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:45:21,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:45:21,576 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:45:21,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:45:21,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:45:21,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:45:21,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:45:21,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:21,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:45:21,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:45:21,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:45:21,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:45:21,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:45:21,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:45:21,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:45:21,579 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:45:21,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:45:21,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:45:21,580 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c [2023-11-22 18:45:21,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:45:21,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:45:21,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:45:21,785 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:45:21,785 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:45:21,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2023-11-22 18:45:22,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:45:22,937 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:45:22,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2023-11-22 18:45:22,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010af2867/06fe574b08974b75a19b6cafcccd0be1/FLAG9f0dea55c [2023-11-22 18:45:22,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010af2867/06fe574b08974b75a19b6cafcccd0be1 [2023-11-22 18:45:22,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:45:22,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:45:22,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:22,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:45:22,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:45:22,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:22" (1/1) ... [2023-11-22 18:45:22,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19fb447d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:22, skipping insertion in model container [2023-11-22 18:45:22,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:22" (1/1) ... [2023-11-22 18:45:22,987 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:45:23,085 WARN L240 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_codestructure_dependencies_file-0.i[918,931] [2023-11-22 18:45:23,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:23,124 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:45:23,132 WARN L240 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_codestructure_dependencies_file-0.i[918,931] [2023-11-22 18:45:23,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:23,159 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:45:23,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23 WrapperNode [2023-11-22 18:45:23,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:23,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:23,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:45:23,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:45:23,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,205 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-11-22 18:45:23,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:23,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:45:23,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:45:23,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:45:23,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,217 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,226 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 18:45:23,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:45:23,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:45:23,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:45:23,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:45:23,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (1/1) ... [2023-11-22 18:45:23,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:23,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:45:23,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:45:23,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:45:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:45:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 18:45:23,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 18:45:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:45:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:45:23,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:45:23,400 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:45:23,401 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:45:23,661 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:45:23,709 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:45:23,712 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 18:45:23,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:23 BoogieIcfgContainer [2023-11-22 18:45:23,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:45:23,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:45:23,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:45:23,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:45:23,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:45:22" (1/3) ... [2023-11-22 18:45:23,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e53532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:23, skipping insertion in model container [2023-11-22 18:45:23,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:23" (2/3) ... [2023-11-22 18:45:23,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e53532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:23, skipping insertion in model container [2023-11-22 18:45:23,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:23" (3/3) ... [2023-11-22 18:45:23,721 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-0.i [2023-11-22 18:45:23,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:45:23,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:45:23,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:45:23,782 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;@27bb17da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:45:23,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:45:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:45:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 18:45:23,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:23,794 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:45:23,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:23,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1801592215, now seen corresponding path program 1 times [2023-11-22 18:45:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675747119] [2023-11-22 18:45:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 18:45:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 18:45:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 18:45:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 18:45:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 18:45:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 18:45:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 18:45:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 18:45:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-22 18:45:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675747119] [2023-11-22 18:45:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675747119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:24,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 18:45:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380529182] [2023-11-22 18:45:24,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:24,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:45:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:24,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:45:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:45:24,656 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-22 18:45:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:24,793 INFO L93 Difference]: Finished difference Result 110 states and 192 transitions. [2023-11-22 18:45:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:45:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2023-11-22 18:45:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:24,802 INFO L225 Difference]: With dead ends: 110 [2023-11-22 18:45:24,803 INFO L226 Difference]: Without dead ends: 74 [2023-11-22 18:45:24,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:45:24,808 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:24,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 136 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:45:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-22 18:45:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2023-11-22 18:45:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-22 18:45:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2023-11-22 18:45:24,870 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 63 [2023-11-22 18:45:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:24,871 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2023-11-22 18:45:24,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-22 18:45:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2023-11-22 18:45:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 18:45:24,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:24,875 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:45:24,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:45:24,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:24,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1813316711, now seen corresponding path program 1 times [2023-11-22 18:45:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240891903] [2023-11-22 18:45:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 18:45:24,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 18:45:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 18:45:25,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 18:45:25,089 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 18:45:25,091 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 18:45:25,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:45:25,096 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-22 18:45:25,098 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 18:45:25,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:45:25 BoogieIcfgContainer [2023-11-22 18:45:25,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 18:45:25,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 18:45:25,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 18:45:25,161 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 18:45:25,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:23" (3/4) ... [2023-11-22 18:45:25,162 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 18:45:25,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 18:45:25,164 INFO L158 Benchmark]: Toolchain (without parser) took 2203.67ms. Allocated memory is still 188.7MB. Free memory was 119.9MB in the beginning and 110.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-11-22 18:45:25,164 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:45:25,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.54ms. Allocated memory is still 188.7MB. Free memory was 119.7MB in the beginning and 107.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 18:45:25,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.87ms. Allocated memory is still 188.7MB. Free memory was 107.0MB in the beginning and 160.5MB in the end (delta: -53.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 18:45:25,165 INFO L158 Benchmark]: Boogie Preprocessor took 33.71ms. Allocated memory is still 188.7MB. Free memory was 160.5MB in the beginning and 157.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 18:45:25,166 INFO L158 Benchmark]: RCFGBuilder took 465.13ms. Allocated memory is still 188.7MB. Free memory was 157.0MB in the beginning and 138.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-22 18:45:25,166 INFO L158 Benchmark]: TraceAbstraction took 1444.85ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 110.1MB in the end (delta: 27.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2023-11-22 18:45:25,166 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 188.7MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:45:25,168 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 188.7MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.54ms. Allocated memory is still 188.7MB. Free memory was 119.7MB in the beginning and 107.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.87ms. Allocated memory is still 188.7MB. Free memory was 107.0MB in the beginning and 160.5MB in the end (delta: -53.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.71ms. Allocated memory is still 188.7MB. Free memory was 160.5MB in the beginning and 157.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.13ms. Allocated memory is still 188.7MB. Free memory was 157.0MB in the beginning and 138.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1444.85ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 110.1MB in the end (delta: 27.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 188.7MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] signed long int last_1_var_1_1 = 0; [L36] signed long int last_1_var_1_5 = 2; [L37] signed short int last_1_var_1_6 = -10; [L38] unsigned long int last_1_var_1_7 = 1; [L39] float last_1_var_1_14 = 5.4; [L40] signed long int last_1_var_1_17 = 64; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L98] last_1_var_1_1 = var_1_1 [L99] last_1_var_1_5 = var_1_5 [L100] last_1_var_1_6 = var_1_6 [L101] last_1_var_1_7 = var_1_7 [L102] last_1_var_1_14 = var_1_14 [L103] last_1_var_1_17 = var_1_17 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] var_1_9 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L82] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L83] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L83] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L84] var_1_10 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L85] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L86] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L86] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L88] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L89] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L89] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L90] var_1_13 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L91] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L92] var_1_15 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L93] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L94] var_1_16 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L95] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L45] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L49] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L52] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L54] COND FALSE !(last_1_var_1_17 < (- last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L57] COND FALSE !(var_1_17 > var_1_17) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L62] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L69] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L71] COND TRUE var_1_6 < var_1_17 [L72] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L74] COND TRUE (- 8u) >= (var_1_9 - var_1_6) [L75] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 49 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=1, InterpolantAutomatonStates: 4, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 144/144 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: unable to determine feasibility of some traces [2023-11-22 18:45:25,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:45:27,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:45:27,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 18:45:27,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:45:27,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:45:27,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:45:27,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:45:27,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:45:27,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:45:27,258 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:45:27,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:45:27,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:45:27,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:45:27,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:45:27,262 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:45:27,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:45:27,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:45:27,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:45:27,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:45:27,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 18:45:27,265 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 18:45:27,265 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 18:45:27,266 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:45:27,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:45:27,266 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:45:27,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:45:27,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:45:27,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:45:27,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:45:27,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:27,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:45:27,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:45:27,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:45:27,269 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 18:45:27,269 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 18:45:27,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:45:27,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:45:27,270 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:45:27,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:45:27,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:45:27,270 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 18:45:27,270 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c [2023-11-22 18:45:27,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:45:27,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:45:27,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:45:27,566 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:45:27,566 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:45:27,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2023-11-22 18:45:28,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:45:28,908 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:45:28,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2023-11-22 18:45:28,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d716ddea/672e0e2567e54d5582bcd620941d7dc5/FLAG6849e837f [2023-11-22 18:45:28,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d716ddea/672e0e2567e54d5582bcd620941d7dc5 [2023-11-22 18:45:28,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:45:28,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:45:28,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:28,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:45:28,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:45:28,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:28" (1/1) ... [2023-11-22 18:45:28,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7225550a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:28, skipping insertion in model container [2023-11-22 18:45:28,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:28" (1/1) ... [2023-11-22 18:45:28,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:45:29,083 WARN L240 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_codestructure_dependencies_file-0.i[918,931] [2023-11-22 18:45:29,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:29,149 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:45:29,162 WARN L240 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_codestructure_dependencies_file-0.i[918,931] [2023-11-22 18:45:29,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:29,200 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:45:29,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29 WrapperNode [2023-11-22 18:45:29,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:29,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:29,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:45:29,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:45:29,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,257 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-11-22 18:45:29,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:29,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:45:29,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:45:29,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:45:29,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,278 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,292 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 18:45:29,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:45:29,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:45:29,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:45:29,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:45:29,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:29,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:45:29,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:45:29,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:45:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:45:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 18:45:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 18:45:29,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 18:45:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:45:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:45:29,495 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:45:29,496 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:45:42,535 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:45:42,577 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:45:42,577 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 18:45:42,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:42 BoogieIcfgContainer [2023-11-22 18:45:42,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:45:42,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:45:42,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:45:42,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:45:42,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:45:28" (1/3) ... [2023-11-22 18:45:42,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9a7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:42, skipping insertion in model container [2023-11-22 18:45:42,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (2/3) ... [2023-11-22 18:45:42,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9a7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:42, skipping insertion in model container [2023-11-22 18:45:42,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:42" (3/3) ... [2023-11-22 18:45:42,584 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-0.i [2023-11-22 18:45:42,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:45:42,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:45:42,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:45:42,656 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;@5393d5c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:45:42,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:45:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:45:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 18:45:42,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:42,670 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:45:42,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:42,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1801592215, now seen corresponding path program 1 times [2023-11-22 18:45:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960901417] [2023-11-22 18:45:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:42,691 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-11-22 18:45:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:42,696 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-11-22 18:45:42,748 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-11-22 18:45:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:44,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 18:45:44,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-22 18:45:50,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:45:50,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960901417] [2023-11-22 18:45:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960901417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:50,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:50,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:45:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300696369] [2023-11-22 18:45:50,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:50,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:45:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:45:50,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:45:50,206 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-22 18:45:53,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 18:45:55,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 18:45:57,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 18:46:00,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 18:46:02,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 18:46:04,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 18:46:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:46:04,698 INFO L93 Difference]: Finished difference Result 110 states and 192 transitions. [2023-11-22 18:46:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:46:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2023-11-22 18:46:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:46:05,024 INFO L225 Difference]: With dead ends: 110 [2023-11-22 18:46:05,024 INFO L226 Difference]: Without dead ends: 74 [2023-11-22 18:46:05,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:46:05,031 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 19 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:46:05,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 136 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 12 Invalid, 6 Unknown, 0 Unchecked, 14.1s Time] [2023-11-22 18:46:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-22 18:46:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2023-11-22 18:46:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-22 18:46:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2023-11-22 18:46:05,082 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 63 [2023-11-22 18:46:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:46:05,083 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2023-11-22 18:46:05,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-22 18:46:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2023-11-22 18:46:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 18:46:05,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:46:05,085 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:46:05,107 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-11-22 18:46:05,301 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-11-22 18:46:05,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:46:05,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:46:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1813316711, now seen corresponding path program 1 times [2023-11-22 18:46:05,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:46:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202998085] [2023-11-22 18:46:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:46:05,303 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-11-22 18:46:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:46:05,304 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-11-22 18:46:05,317 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-11-22 18:46:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:46:06,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-22 18:46:06,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:21,647 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (or (fp.lt c_~last_1_var_1_14~0 c_~var_1_16~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 18:47:23,751 WARN L876 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (or (fp.lt c_~last_1_var_1_14~0 c_~var_1_16~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-22 18:47:46,812 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (= c_~var_1_1~0 (_ bv0 32)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (or (fp.lt c_~last_1_var_1_14~0 c_~var_1_16~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 18:47:48,916 WARN L876 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (= c_~var_1_1~0 (_ bv0 32)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (or (fp.lt c_~last_1_var_1_14~0 c_~var_1_16~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-22 18:48:36,266 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (= c_~var_1_1~0 (_ bv0 32)) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 18:48:38,374 WARN L876 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (= c_~var_1_1~0 (_ bv0 32)) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-22 18:49:18,334 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (= c_~var_1_1~0 (_ bv0 32)) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 18:49:20,480 WARN L876 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 16) (bvadd c_~var_1_6~0 (_ bv10 16))) (= c_~var_1_17~0 (_ bv0 32)) (= c_~var_1_1~0 (_ bv0 32)) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_1~0 (_ bv0 32)) (= (_ bv0 16) (bvadd c_~last_1_var_1_6~0 (_ bv10 16))) (= c_~var_1_7~0 (_ bv1 32)) (= c_~last_1_var_1_17~0 (_ bv64 32)) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~last_1_var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true Killed by 15