./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.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 d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:35:45,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:35:45,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:35:45,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:35:45,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:35:45,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:35:45,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:35:45,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:35:45,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:35:45,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:35:45,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:35:45,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:35:45,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:35:45,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:35:45,602 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:35:45,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:35:45,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:35:45,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:35:45,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:35:45,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:35:45,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:35:45,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:35:45,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:35:45,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:35:45,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:35:45,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:35:45,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:35:45,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:35:45,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:35:45,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:35:45,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:35:45,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:35:45,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:35:45,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:35:45,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:35:45,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:35:45,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:35:45,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:35:45,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:35:45,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:35:45,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:35:45,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:35:45,609 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 -> d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 [2024-11-16 15:35:45,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:35:45,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:35:45,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:35:45,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:35:45,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:35:45,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2024-11-16 15:35:47,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:35:47,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:35:47,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2024-11-16 15:35:47,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614e3a6b2/83fa8b5e80c74db385f08c3fd4953869/FLAG7a3b1c59b [2024-11-16 15:35:47,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614e3a6b2/83fa8b5e80c74db385f08c3fd4953869 [2024-11-16 15:35:47,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:35:47,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:35:47,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:35:47,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:35:47,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:35:47,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6014bad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47, skipping insertion in model container [2024-11-16 15:35:47,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:35:47,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i[917,930] [2024-11-16 15:35:47,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:35:47,542 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:35:47,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i[917,930] [2024-11-16 15:35:47,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:35:47,631 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:35:47,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47 WrapperNode [2024-11-16 15:35:47,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:35:47,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:35:47,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:35:47,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:35:47,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,674 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-16 15:35:47,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:35:47,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:35:47,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:35:47,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:35:47,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,695 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:35:47,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:35:47,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:35:47,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:35:47,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:35:47,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (1/1) ... [2024-11-16 15:35:47,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:35:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:35:47,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:35:47,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:35:47,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:35:47,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:35:47,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:35:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:35:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:35:47,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:35:47,839 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:35:47,841 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:35:48,031 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:35:48,031 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:35:48,042 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:35:48,042 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:35:48,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:35:48 BoogieIcfgContainer [2024-11-16 15:35:48,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:35:48,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:35:48,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:35:48,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:35:48,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:35:47" (1/3) ... [2024-11-16 15:35:48,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28419c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:35:48, skipping insertion in model container [2024-11-16 15:35:48,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:35:47" (2/3) ... [2024-11-16 15:35:48,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28419c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:35:48, skipping insertion in model container [2024-11-16 15:35:48,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:35:48" (3/3) ... [2024-11-16 15:35:48,050 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-16.i [2024-11-16 15:35:48,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:35:48,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:35:48,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:35:48,113 INFO L333 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, 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;@5d63e12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:35:48,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:35:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:35:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 15:35:48,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:35:48,126 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:35:48,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:35:48,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:35:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash 702982399, now seen corresponding path program 1 times [2024-11-16 15:35:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:35:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116835007] [2024-11-16 15:35:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:35:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:35:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:35:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:35:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 15:35:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:35:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:35:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 15:35:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:35:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 15:35:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:35:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:35:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:35:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:35:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:35:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:35:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:35:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:35:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 15:35:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:35:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 15:35:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:35:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 15:35:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:35:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:35:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116835007] [2024-11-16 15:35:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116835007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:35:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:35:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:35:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489471942] [2024-11-16 15:35:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:35:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:35:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:35:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:35:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:35:48,458 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:35:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:35:48,477 INFO L93 Difference]: Finished difference Result 114 states and 194 transitions. [2024-11-16 15:35:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:35:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-11-16 15:35:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:35:48,484 INFO L225 Difference]: With dead ends: 114 [2024-11-16 15:35:48,484 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 15:35:48,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:35:48,489 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:35:48,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:35:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 15:35:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 15:35:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:35:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2024-11-16 15:35:48,533 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 131 [2024-11-16 15:35:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:35:48,534 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2024-11-16 15:35:48,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:35:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2024-11-16 15:35:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 15:35:48,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:35:48,538 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:35:48,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:35:48,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:35:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:35:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -533130078, now seen corresponding path program 1 times [2024-11-16 15:35:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:35:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697632806] [2024-11-16 15:35:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:35:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:35:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:35:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:35:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 15:35:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:35:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:35:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 15:35:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:35:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 15:35:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:35:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:35:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:35:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:35:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:35:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:35:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:35:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:35:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 15:35:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:35:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 15:35:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:35:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 15:35:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-16 15:35:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:35:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697632806] [2024-11-16 15:35:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697632806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:35:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071427287] [2024-11-16 15:35:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:35:50,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:35:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:35:50,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:35:50,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:35:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:35:50,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 15:35:50,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:35:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 312 proven. 96 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-16 15:35:51,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:36:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071427287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:36:13,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:36:13,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-16 15:36:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93480441] [2024-11-16 15:36:13,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:36:13,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 15:36:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 15:36:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2024-11-16 15:36:13,312 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-16 15:36:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:13,829 INFO L93 Difference]: Finished difference Result 183 states and 259 transitions. [2024-11-16 15:36:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 15:36:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 131 [2024-11-16 15:36:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:13,832 INFO L225 Difference]: With dead ends: 183 [2024-11-16 15:36:13,832 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 15:36:13,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=186, Invalid=515, Unknown=1, NotChecked=0, Total=702 [2024-11-16 15:36:13,834 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:13,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 328 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:36:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 15:36:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2024-11-16 15:36:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 15:36:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-16 15:36:13,868 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2024-11-16 15:36:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:13,869 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-16 15:36:13,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-16 15:36:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-16 15:36:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 15:36:13,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:13,871 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:13,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 15:36:14,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:36:14,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:14,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -729643583, now seen corresponding path program 1 times [2024-11-16 15:36:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202694095] [2024-11-16 15:36:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:36:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574933367] [2024-11-16 15:36:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:14,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:36:14,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:14,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:36:14,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 15:36:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:36:14,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:36:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:36:14,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:36:14,267 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:36:14,268 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:36:14,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 15:36:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-16 15:36:14,473 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 15:36:14,531 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:36:14,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:36:14 BoogieIcfgContainer [2024-11-16 15:36:14,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:36:14,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:36:14,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:36:14,535 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:36:14,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:35:48" (3/4) ... [2024-11-16 15:36:14,537 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:36:14,538 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:36:14,538 INFO L158 Benchmark]: Toolchain (without parser) took 27230.69ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 99.2MB in the beginning and 303.8MB in the end (delta: -204.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-16 15:36:14,539 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory was 77.5MB in the beginning and 77.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:36:14,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.54ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 140.2MB in the end (delta: -41.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 15:36:14,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.14ms. Allocated memory is still 167.8MB. Free memory was 140.2MB in the beginning and 138.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:36:14,540 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 167.8MB. Free memory was 138.1MB in the beginning and 135.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:36:14,540 INFO L158 Benchmark]: IcfgBuilder took 338.46ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 118.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 15:36:14,540 INFO L158 Benchmark]: TraceAbstraction took 26489.73ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 118.0MB in the beginning and 304.8MB in the end (delta: -186.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 15:36:14,541 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 377.5MB. Free memory was 304.8MB in the beginning and 303.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:36:14,542 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory was 77.5MB in the beginning and 77.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.54ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 140.2MB in the end (delta: -41.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.14ms. Allocated memory is still 167.8MB. Free memory was 140.2MB in the beginning and 138.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 167.8MB. Free memory was 138.1MB in the beginning and 135.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 338.46ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 118.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26489.73ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 118.0MB in the beginning and 304.8MB in the end (delta: -186.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 377.5MB. Free memory was 304.8MB in the beginning and 303.8MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_3 = 4; [L24] signed short int var_1_4 = 256; [L25] unsigned char var_1_5 = 0; [L26] unsigned char var_1_6 = 1; [L27] float var_1_7 = 1000000.8; [L28] float var_1_8 = 3.8; [L29] signed char var_1_9 = 25; [L30] float var_1_10 = 2.75; [L31] signed char var_1_11 = 0; [L32] signed char var_1_12 = 32; [L33] signed char var_1_13 = 2; [L34] signed char var_1_14 = 2; [L35] signed short int var_1_15 = -32; [L36] signed char last_1_var_1_9 = 25; VAL [isInitial=0, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=4, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=4, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L69] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L69] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L70] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L70] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L71] var_1_4 = __VERIFIER_nondet_short() [L72] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L72] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L74] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L76] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L77] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L77] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L79] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L80] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L80] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L81] var_1_8 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L82] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L84] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L85] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L90] RET assume_abort_if_not(var_1_12 >= 31) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L92] var_1_13 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L94] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L94] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L95] var_1_14 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L96] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L97] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L97] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L111] RET updateVariables() [L112] CALL step() [L40] COND FALSE !((last_1_var_1_9 % ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) <= -1000000) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L43] var_1_7 = var_1_8 [L44] signed char stepLocal_2 = var_1_11; [L45] unsigned char stepLocal_1 = 99999.375 <= var_1_10; VAL [isInitial=1, last_1_var_1_9=25, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L46] COND FALSE !(var_1_13 <= stepLocal_2) [L51] var_1_15 = -25 VAL [isInitial=1, last_1_var_1_9=25, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L53] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_9=25, stepLocal_0=1, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L54] COND FALSE !(var_1_8 < (var_1_7 / var_1_10)) VAL [isInitial=1, last_1_var_1_9=25, stepLocal_0=1, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_9 % ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) <= -1000000) ? (var_1_1 == ((unsigned char) (var_1_5 || var_1_6))) : 1) && (var_1_7 == ((float) var_1_8))) && ((var_1_8 < (var_1_7 / var_1_10)) ? ((var_1_1 || var_1_6) ? (var_1_9 == ((signed char) ((((((var_1_11) > (5)) ? (var_1_11) : (5))) + (var_1_12 - var_1_13)) - var_1_14))) : ((var_1_10 > var_1_8) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_12)))) : 1)) && ((var_1_13 <= var_1_11) ? (((var_1_8 < var_1_7) && (99999.375 <= var_1_10)) ? (var_1_15 == ((signed short int) (var_1_13 + var_1_14))) : 1) : (var_1_15 == ((signed short int) -25))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=35, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 268 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 142 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 655 NumberOfCodeBlocks, 655 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 2648 SizeOfPredicates, 4 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2328/2520 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 [2024-11-16 15:36:14,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.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 d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:36:16,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:36:16,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:36:16,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:36:16,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:36:16,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:36:16,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:36:16,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:36:16,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:36:16,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:36:16,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:36:16,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:36:16,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:36:16,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:36:16,653 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:36:16,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:36:16,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:36:16,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:36:16,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:36:16,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:36:16,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:36:16,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:36:16,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:36:16,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:36:16,657 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:36:16,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:36:16,657 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:36:16,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:36:16,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:36:16,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:36:16,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:36:16,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:36:16,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:36:16,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:36:16,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:16,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:36:16,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:36:16,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:36:16,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:36:16,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:36:16,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:36:16,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:36:16,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:36:16,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:36:16,661 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 -> d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 [2024-11-16 15:36:16,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:36:16,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:36:16,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:36:16,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:36:16,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:36:16,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2024-11-16 15:36:18,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:36:18,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:36:18,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2024-11-16 15:36:18,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb1a805a/ec1e5e638e1e43cc9bcf3c2492449c49/FLAG49784d960 [2024-11-16 15:36:18,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb1a805a/ec1e5e638e1e43cc9bcf3c2492449c49 [2024-11-16 15:36:18,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:36:18,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:36:18,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:18,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:36:18,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:36:18,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:18" (1/1) ... [2024-11-16 15:36:18,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25151cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:18, skipping insertion in model container [2024-11-16 15:36:18,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:18" (1/1) ... [2024-11-16 15:36:18,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:36:19,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i[917,930] [2024-11-16 15:36:19,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:19,149 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:36:19,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i[917,930] [2024-11-16 15:36:19,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:19,205 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:36:19,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19 WrapperNode [2024-11-16 15:36:19,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:19,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:19,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:36:19,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:36:19,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,252 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-16 15:36:19,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:19,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:36:19,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:36:19,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:36:19,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,273 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:36:19,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:36:19,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:36:19,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:36:19,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:36:19,299 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (1/1) ... [2024-11-16 15:36:19,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:19,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:19,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:36:19,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:36:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:36:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:36:19,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:36:19,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:36:19,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:36:19,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:36:19,427 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:36:19,429 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:36:22,432 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:36:22,433 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:36:22,448 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:36:22,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:36:22,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:22 BoogieIcfgContainer [2024-11-16 15:36:22,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:36:22,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:36:22,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:36:22,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:36:22,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:36:18" (1/3) ... [2024-11-16 15:36:22,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc0d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:22, skipping insertion in model container [2024-11-16 15:36:22,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:19" (2/3) ... [2024-11-16 15:36:22,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc0d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:22, skipping insertion in model container [2024-11-16 15:36:22,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:22" (3/3) ... [2024-11-16 15:36:22,468 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-16.i [2024-11-16 15:36:22,495 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:36:22,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:36:22,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:36:22,575 INFO L333 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, 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;@5504a5c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:36:22,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:36:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:36:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 15:36:22,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:22,597 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:22,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:22,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash 702982399, now seen corresponding path program 1 times [2024-11-16 15:36:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:22,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967030036] [2024-11-16 15:36:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:22,623 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 [2024-11-16 15:36:22,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:22,629 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) [2024-11-16 15:36:22,634 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 [2024-11-16 15:36:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:23,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:36:23,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:36:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-16 15:36:23,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:36:23,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:36:23,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967030036] [2024-11-16 15:36:23,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967030036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:23,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:23,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:36:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483177766] [2024-11-16 15:36:23,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:23,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:36:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:36:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:36:23,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:23,151 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:36:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:23,188 INFO L93 Difference]: Finished difference Result 114 states and 194 transitions. [2024-11-16 15:36:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:36:23,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-11-16 15:36:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:23,197 INFO L225 Difference]: With dead ends: 114 [2024-11-16 15:36:23,202 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 15:36:23,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:23,211 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:23,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:36:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 15:36:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 15:36:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:36:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-16 15:36:23,258 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 131 [2024-11-16 15:36:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:23,258 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-16 15:36:23,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:36:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-16 15:36:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 15:36:23,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:23,263 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:23,275 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 [2024-11-16 15:36:23,463 WARN L453 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 [2024-11-16 15:36:23,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash -729643583, now seen corresponding path program 1 times [2024-11-16 15:36:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791228790] [2024-11-16 15:36:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:23,466 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 [2024-11-16 15:36:23,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:23,469 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) [2024-11-16 15:36:23,494 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 [2024-11-16 15:36:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:23,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 15:36:23,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:36:42,959 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)