./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-98.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 d1acbf404a979e4df8614d404cb21fac8f039451044a2af0cc00276457f93654 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:27:17,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:27:17,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:27:17,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:27:17,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:27:17,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:27:17,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:27:17,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:27:17,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:27:17,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:27:17,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:27:17,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:27:17,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:27:17,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:27:17,817 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:27:17,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:27:17,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:27:17,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:27:17,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:27:17,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:27:17,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:27:17,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:27:17,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:27:17,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:27:17,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:27:17,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:27:17,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:27:17,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:27:17,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:27:17,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:27:17,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:27:17,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:27:17,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:17,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:27:17,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:27:17,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:27:17,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:27:17,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:27:17,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:27:17,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:27:17,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:27:17,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:27:17,829 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 -> d1acbf404a979e4df8614d404cb21fac8f039451044a2af0cc00276457f93654 [2024-10-24 05:27:18,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:27:18,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:27:18,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:27:18,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:27:18,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:27:18,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-98.i [2024-10-24 05:27:19,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:27:19,808 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:27:19,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-98.i [2024-10-24 05:27:19,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab72b303a/11923fa18ad7467cbfe4960c4e2583b4/FLAG6ebb2eefc [2024-10-24 05:27:19,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab72b303a/11923fa18ad7467cbfe4960c4e2583b4 [2024-10-24 05:27:19,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:27:19,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:27:19,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:19,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:27:19,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:27:19,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:19" (1/1) ... [2024-10-24 05:27:19,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f59079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:19, skipping insertion in model container [2024-10-24 05:27:19,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:19" (1/1) ... [2024-10-24 05:27:19,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:27:20,049 WARN L248 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_codestructure_normal_file-98.i[913,926] [2024-10-24 05:27:20,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:20,114 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:27:20,126 WARN L248 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_codestructure_normal_file-98.i[913,926] [2024-10-24 05:27:20,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:20,173 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:27:20,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20 WrapperNode [2024-10-24 05:27:20,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:20,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:20,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:27:20,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:27:20,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,234 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-24 05:27:20,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:20,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:27:20,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:27:20,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:27:20,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,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-10-24 05:27:20,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:27:20,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:27:20,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:27:20,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:27:20,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:20,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:27:20,349 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-10-24 05:27:20,357 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-10-24 05:27:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:27:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:27:20,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:27:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:27:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:27:20,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:27:20,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:27:20,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:27:20,927 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:27:20,928 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:27:20,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:27:20,984 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:27:20,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:20 BoogieIcfgContainer [2024-10-24 05:27:20,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:27:20,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:27:20,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:27:20,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:27:20,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:27:19" (1/3) ... [2024-10-24 05:27:20,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143a36e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:20, skipping insertion in model container [2024-10-24 05:27:20,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (2/3) ... [2024-10-24 05:27:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143a36e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:20, skipping insertion in model container [2024-10-24 05:27:20,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:20" (3/3) ... [2024-10-24 05:27:20,997 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-98.i [2024-10-24 05:27:21,012 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:27:21,012 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:27:21,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:27:21,075 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;@20519238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:27:21,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:27:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 05:27:21,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:21,095 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:21,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1054997129, now seen corresponding path program 1 times [2024-10-24 05:27:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:27:21,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241272819] [2024-10-24 05:27:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:27:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:27:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:27:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:27:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:27:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:27:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:27:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:27:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:27:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:27:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 05:27:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:27:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:27:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:27:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:27:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:27:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:27:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:27:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:27:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:27:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:27:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:27:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:27:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:27:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:27:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:27:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:27:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 05:27:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 05:27:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:27:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:27:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241272819] [2024-10-24 05:27:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241272819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:27:21,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:27:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:27:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920998827] [2024-10-24 05:27:21,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:27:21,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:27:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:27:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:27:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:27:21,684 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:27:21,736 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2024-10-24 05:27:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:27:21,739 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-10-24 05:27:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:27:21,748 INFO L225 Difference]: With dead ends: 143 [2024-10-24 05:27:21,748 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 05:27:21,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-10-24 05:27:21,756 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:27:21,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:27:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 05:27:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 05:27:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-10-24 05:27:21,809 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 170 [2024-10-24 05:27:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:27:21,814 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-10-24 05:27:21,814 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-10-24 05:27:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 05:27:21,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:21,820 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:21,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:27:21,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1867916177, now seen corresponding path program 1 times [2024-10-24 05:27:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:27:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201122666] [2024-10-24 05:27:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:27:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:27:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433213163] [2024-10-24 05:27:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:27:22,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:27:22,162 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-10-24 05:27:22,164 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-10-24 05:27:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:27:22,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:27:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:27:22,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:27:22,479 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:27:22,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:27:22,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:27:22,684 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-10-24 05:27:22,687 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 05:27:22,818 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:27:22,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:27:22 BoogieIcfgContainer [2024-10-24 05:27:22,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:27:22,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:27:22,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:27:22,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:27:22,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:20" (3/4) ... [2024-10-24 05:27:22,830 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:27:22,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:27:22,832 INFO L158 Benchmark]: Toolchain (without parser) took 2992.87ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 102.3MB in the beginning and 73.3MB in the end (delta: 29.0MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2024-10-24 05:27:22,832 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:27:22,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.45ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 86.7MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:27:22,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.76ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 83.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:27:22,833 INFO L158 Benchmark]: Boogie Preprocessor took 58.91ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:27:22,834 INFO L158 Benchmark]: RCFGBuilder took 690.61ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 79.3MB in the beginning and 186.6MB in the end (delta: -107.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-10-24 05:27:22,834 INFO L158 Benchmark]: TraceAbstraction took 1837.41ms. Allocated memory is still 226.5MB. Free memory was 186.6MB in the beginning and 73.3MB in the end (delta: 113.3MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2024-10-24 05:27:22,834 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 226.5MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:27:22,836 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.20ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.45ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 86.7MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.76ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 83.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.91ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 690.61ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 79.3MB in the beginning and 186.6MB in the end (delta: -107.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1837.41ms. Allocated memory is still 226.5MB. Free memory was 186.6MB in the beginning and 73.3MB in the end (delta: 113.3MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 226.5MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of bitwiseAnd at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_2 = 2; [L24] signed short int var_1_3 = -32; [L25] signed short int var_1_4 = -10; [L26] signed short int var_1_5 = 100; [L27] double var_1_6 = 0.5; [L28] double var_1_7 = 16.5; [L29] double var_1_8 = 7.4; [L30] unsigned short int var_1_9 = 4; [L31] unsigned char var_1_10 = 0; [L32] unsigned long int var_1_11 = 1000000000; [L33] unsigned short int var_1_12 = 256; [L34] signed short int var_1_13 = 16; [L35] signed short int var_1_14 = 64; [L36] unsigned short int var_1_15 = 63836; [L37] unsigned short int var_1_16 = 10; [L38] signed char var_1_17 = -8; [L39] signed char var_1_18 = 8; [L40] signed short int var_1_19 = 50; [L41] signed short int var_1_20 = 10; [L42] signed short int var_1_21 = 10000; [L43] signed char var_1_22 = -2; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_short() [L84] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L84] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L85] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L85] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L86] var_1_3 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] var_1_4 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L90] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L91] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L91] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] var_1_5 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L94] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L95] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L95] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L97] var_1_7 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L98] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L99] var_1_8 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L100] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L101] var_1_10 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L102] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L103] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L104] var_1_13 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L105] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L106] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L107] var_1_14 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L108] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L109] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L109] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L110] var_1_15 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L111] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L112] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L112] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L113] var_1_16 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L115] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L116] var_1_18 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L117] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L118] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L119] var_1_20 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L121] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L122] var_1_21 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L123] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L124] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L124] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L137] RET updateVariables() [L138] CALL step() [L47] EXPR (var_1_3 / var_1_4) & 8 VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=-64, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L47] COND FALSE !(var_1_2 <= ((var_1_3 / var_1_4) & 8)) [L56] COND TRUE var_1_3 <= var_1_2 [L57] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L62] COND TRUE var_1_2 <= var_1_3 [L63] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L70] var_1_11 = (((((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) : ((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))))) VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=256, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L71] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= var_1_3 [L72] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=-8, var_1_18=0, var_1_19=50, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L74] var_1_17 = var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=50, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L75] COND TRUE var_1_13 <= var_1_12 [L76] var_1_19 = ((var_1_17 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L80] var_1_22 = var_1_18 [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR (var_1_3 / var_1_4) & 8 VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=0, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L129-L130] return ((((((((var_1_2 <= ((var_1_3 / var_1_4) & 8)) ? ((-16 <= var_1_3) ? ((var_1_2 != (var_1_3 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))))) : (var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) : 1) : ((var_1_3 <= var_1_2) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_3)))) && ((var_1_2 <= var_1_3) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_1 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) : ((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= var_1_3) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_12) ? (var_1_19 == ((signed short int) ((var_1_17 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_17)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_17))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=0, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=32767, var_1_13=0, var_1_14=0, var_1_15=32767, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=8165, var_1_21=8191, var_1_22=0, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 107 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1512/1512 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-10-24 05:27:22,867 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-98.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 d1acbf404a979e4df8614d404cb21fac8f039451044a2af0cc00276457f93654 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:27:25,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:27:25,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:27:25,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:27:25,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:27:25,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:27:25,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:27:25,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:27:25,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:27:25,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:27:25,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:27:25,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:27:25,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:27:25,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:27:25,321 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:27:25,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:27:25,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:27:25,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:27:25,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:27:25,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:27:25,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:27:25,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:27:25,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:27:25,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:27:25,328 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:27:25,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:27:25,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:27:25,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:27:25,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:27:25,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:27:25,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:27:25,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:27:25,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:27:25,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:27:25,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:25,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:27:25,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:27:25,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:27:25,333 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:27:25,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:27:25,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:27:25,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:27:25,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:27:25,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:27:25,334 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:27:25,334 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 -> d1acbf404a979e4df8614d404cb21fac8f039451044a2af0cc00276457f93654 [2024-10-24 05:27:25,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:27:25,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:27:25,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:27:25,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:27:25,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:27:25,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-98.i [2024-10-24 05:27:27,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:27:27,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:27:27,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-98.i [2024-10-24 05:27:27,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221a05d1e/debb58193a164363af7ed8a14226ee05/FLAG57c0fe0cb [2024-10-24 05:27:27,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221a05d1e/debb58193a164363af7ed8a14226ee05 [2024-10-24 05:27:27,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:27:27,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:27:27,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:27,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:27:27,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:27:27,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:27,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd0b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27, skipping insertion in model container [2024-10-24 05:27:27,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:27,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:27:27,705 WARN L248 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_codestructure_normal_file-98.i[913,926] [2024-10-24 05:27:27,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:27,811 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:27:27,823 WARN L248 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_codestructure_normal_file-98.i[913,926] [2024-10-24 05:27:27,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:27,895 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:27:27,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27 WrapperNode [2024-10-24 05:27:27,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:27,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:27,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:27:27,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:27:27,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:27,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:27,966 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-24 05:27:27,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:27,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:27:27,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:27:27,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:27:27,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:27,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:27,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,008 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-10-24 05:27:28,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:27:28,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:27:28,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:27:28,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:27:28,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (1/1) ... [2024-10-24 05:27:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:28,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:27:28,090 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-10-24 05:27:28,093 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-10-24 05:27:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:27:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:27:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:27:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:27:28,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:27:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:27:28,262 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:27:28,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:27:29,268 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:27:29,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:27:29,355 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:27:29,357 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:27:29,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:29 BoogieIcfgContainer [2024-10-24 05:27:29,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:27:29,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:27:29,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:27:29,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:27:29,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:27:27" (1/3) ... [2024-10-24 05:27:29,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4af6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:29, skipping insertion in model container [2024-10-24 05:27:29,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:27" (2/3) ... [2024-10-24 05:27:29,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4af6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:29, skipping insertion in model container [2024-10-24 05:27:29,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:29" (3/3) ... [2024-10-24 05:27:29,370 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-98.i [2024-10-24 05:27:29,388 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:27:29,388 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:27:29,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:27:29,478 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;@18c44716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:27:29,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:27:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 05:27:29,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:29,501 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:29,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1038119148, now seen corresponding path program 1 times [2024-10-24 05:27:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:27:29,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458318215] [2024-10-24 05:27:29,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:29,526 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-10-24 05:27:29,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:27:29,529 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-10-24 05:27:29,531 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-10-24 05:27:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:27:29,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:27:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-24 05:27:29,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:27:29,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:27:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458318215] [2024-10-24 05:27:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458318215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:27:29,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:27:29,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:27:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436002051] [2024-10-24 05:27:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:27:29,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:27:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:27:29,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:27:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:27:29,975 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:27:30,755 INFO L93 Difference]: Finished difference Result 129 states and 236 transitions. [2024-10-24 05:27:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:27:30,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 167 [2024-10-24 05:27:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:27:30,780 INFO L225 Difference]: With dead ends: 129 [2024-10-24 05:27:30,781 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 05:27:30,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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-10-24 05:27:30,791 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:27:30,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:27:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 05:27:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-24 05:27:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2024-10-24 05:27:30,842 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 167 [2024-10-24 05:27:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:27:30,842 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2024-10-24 05:27:30,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2024-10-24 05:27:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 05:27:30,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:30,847 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:30,860 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-10-24 05:27:31,051 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-10-24 05:27:31,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:31,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1767646436, now seen corresponding path program 1 times [2024-10-24 05:27:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:27:31,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057654172] [2024-10-24 05:27:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:31,055 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-10-24 05:27:31,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:27:31,058 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-10-24 05:27:31,059 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-10-24 05:27:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:31,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 05:27:31,372 INFO L278 TraceCheckSpWp]: Computing forward predicates...