/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:56:13,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:56:13,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:56:13,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:56:13,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:56:13,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:56:13,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:56:13,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:56:13,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:56:13,874 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:56:13,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:56:13,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:56:13,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:56:13,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:56:13,876 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:56:13,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:56:13,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:56:13,877 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:56:13,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:56:13,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:56:13,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:56:13,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:56:13,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:56:13,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:56:13,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:56:13,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:56:13,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:56:13,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:56:13,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:56:13,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:56:13,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:56:13,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:56:13,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:56:13,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:56:13,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:56:13,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:56:13,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:56:13,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:56:13,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:56:13,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:56:13,881 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:56:13,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:56:13,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:56:13,881 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: Use bitabs translation -> true [2023-12-15 20:56:14,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:56:14,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:56:14,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:56:14,074 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:56:14,075 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:56:14,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i [2023-12-15 20:56:15,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:56:15,176 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:56:15,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i [2023-12-15 20:56:15,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232e14626/29fe1a9bb3dd4f18bd24558188c00edf/FLAG3933a4b51 [2023-12-15 20:56:15,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232e14626/29fe1a9bb3dd4f18bd24558188c00edf [2023-12-15 20:56:15,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:56:15,196 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:56:15,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:56:15,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:56:15,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:56:15,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136e057a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15, skipping insertion in model container [2023-12-15 20:56:15,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,226 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:56:15,321 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i[915,928] [2023-12-15 20:56:15,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:56:15,349 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:56:15,357 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i[915,928] [2023-12-15 20:56:15,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:56:15,378 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:56:15,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15 WrapperNode [2023-12-15 20:56:15,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:56:15,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:56:15,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:56:15,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:56:15,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,405 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2023-12-15 20:56:15,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:56:15,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:56:15,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:56:15,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:56:15,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,421 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:56:15,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:56:15,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:56:15,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:56:15,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:56:15,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (1/1) ... [2023-12-15 20:56:15,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:56:15,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:56:15,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:56:15,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:56:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:56:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:56:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:56:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:56:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:56:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:56:15,540 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:56:15,543 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:56:15,728 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:56:15,779 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:56:15,779 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:56:15,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:56:15 BoogieIcfgContainer [2023-12-15 20:56:15,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:56:15,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:56:15,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:56:15,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:56:15,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:56:15" (1/3) ... [2023-12-15 20:56:15,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe0ec38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:56:15, skipping insertion in model container [2023-12-15 20:56:15,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:56:15" (2/3) ... [2023-12-15 20:56:15,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe0ec38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:56:15, skipping insertion in model container [2023-12-15 20:56:15,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:56:15" (3/3) ... [2023-12-15 20:56:15,785 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-47.i [2023-12-15 20:56:15,797 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:56:15,798 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:56:15,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:56:15,835 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2622ae54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:56:15,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:56:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 20:56:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 20:56:15,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:56:15,845 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:56:15,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:56:15,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:56:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2066073024, now seen corresponding path program 1 times [2023-12-15 20:56:15,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:56:15,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837728486] [2023-12-15 20:56:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:56:15,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:56:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:56:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 20:56:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 20:56:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 20:56:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 20:56:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:56:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:56:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:56:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:56:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 20:56:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:56:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-15 20:56:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:56:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837728486] [2023-12-15 20:56:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837728486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:56:16,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:56:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:56:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290061965] [2023-12-15 20:56:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:56:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:56:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:56:16,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:56:16,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:56:16,137 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 20:56:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:56:16,185 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2023-12-15 20:56:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:56:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2023-12-15 20:56:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:56:16,191 INFO L225 Difference]: With dead ends: 67 [2023-12-15 20:56:16,192 INFO L226 Difference]: Without dead ends: 33 [2023-12-15 20:56:16,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:56:16,196 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 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.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:56:16,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:56:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-15 20:56:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-15 20:56:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 20:56:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2023-12-15 20:56:16,229 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 65 [2023-12-15 20:56:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:56:16,230 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2023-12-15 20:56:16,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 20:56:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2023-12-15 20:56:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 20:56:16,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:56:16,232 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:56:16,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:56:16,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:56:16,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:56:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -62286396, now seen corresponding path program 1 times [2023-12-15 20:56:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:56:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616459753] [2023-12-15 20:56:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:56:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:56:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:56:16,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:56:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:56:16,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:56:16,413 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:56:16,414 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:56:16,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:56:16,417 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-15 20:56:16,419 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:56:16,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:56:16 BoogieIcfgContainer [2023-12-15 20:56:16,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:56:16,449 INFO L158 Benchmark]: Toolchain (without parser) took 1253.43ms. Allocated memory is still 293.6MB. Free memory was 241.4MB in the beginning and 222.9MB in the end (delta: 18.4MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2023-12-15 20:56:16,450 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:56:16,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.10ms. Allocated memory is still 293.6MB. Free memory was 241.2MB in the beginning and 228.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:56:16,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 293.6MB. Free memory was 228.8MB in the beginning and 226.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:56:16,451 INFO L158 Benchmark]: Boogie Preprocessor took 23.91ms. Allocated memory is still 293.6MB. Free memory was 226.7MB in the beginning and 224.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:56:16,451 INFO L158 Benchmark]: RCFGBuilder took 349.73ms. Allocated memory is still 293.6MB. Free memory was 224.6MB in the beginning and 209.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 20:56:16,451 INFO L158 Benchmark]: TraceAbstraction took 668.02ms. Allocated memory is still 293.6MB. Free memory was 208.7MB in the beginning and 222.9MB in the end (delta: -14.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:56:16,453 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.09ms. Allocated memory is still 178.3MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.10ms. Allocated memory is still 293.6MB. Free memory was 241.2MB in the beginning and 228.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 293.6MB. Free memory was 228.8MB in the beginning and 226.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.91ms. Allocated memory is still 293.6MB. Free memory was 226.7MB in the beginning and 224.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 349.73ms. Allocated memory is still 293.6MB. Free memory was 224.6MB in the beginning and 209.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 668.02ms. Allocated memory is still 293.6MB. Free memory was 208.7MB in the beginning and 222.9MB in the end (delta: -14.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryFLOAToperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 128.5; [L24] float var_1_9 = -0.5; [L25] float var_1_10 = 200.4; [L26] unsigned long int var_1_11 = 4; [L27] unsigned char var_1_12 = 1; [L28] unsigned long int var_1_13 = 3607105345; [L29] signed char var_1_14 = 0; [L30] signed char var_1_15 = 0; [L31] signed char var_1_16 = 16; [L32] double last_1_var_1_1 = 24.575; [L33] float last_1_var_1_9 = -0.5; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_1 = var_1_1 [L78] last_1_var_1_9 = var_1_9 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L59] var_1_8 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L60] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L62] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L63] var_1_12 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L64] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L65] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L65] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L66] var_1_13 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L67] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L68] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L68] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L69] var_1_15 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L70] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L71] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L71] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L72] var_1_16 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L74] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L74] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=0, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L89] RET updateVariables() [L90] CALL step() [L37] COND FALSE !(((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) [L42] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483647, var_1_14=-1, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L44] COND FALSE !(\read(var_1_12)) [L47] var_1_11 = ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4294967295, var_1_12=0, var_1_13=2147483647, var_1_14=-1, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105352] [L49] var_1_9 = ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4294967295, var_1_12=0, var_1_13=2147483647, var_1_14=-1, var_1_15=-1, var_1_16=1, var_1_1=983/40, var_1_9=3607105350] [L50] COND FALSE !(var_1_9 <= var_1_9) [L55] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4294967295, var_1_12=0, var_1_13=2147483647, var_1_14=-1, var_1_15=-1, var_1_16=1, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_9 <= var_1_9) ? (((var_1_11 + var_1_11) >= (var_1_14 + var_1_14)) ? (var_1_1 == ((double) var_1_8)) : 1) : (var_1_1 == ((double) var_1_8))) && (var_1_9 == ((float) ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f))))))))) && (var_1_12 ? (var_1_11 == ((unsigned long int) ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))))) : (var_1_11 == ((unsigned long int) ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))))))) && ((((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) ? (var_1_12 ? (var_1_14 == ((signed char) (var_1_15 - var_1_16))) : 1) : (var_1_14 == ((signed char) var_1_15))) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4294967295, var_1_12=0, var_1_13=2147483647, var_1_14=-1, var_1_15=-1, var_1_16=1, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4294967295, var_1_12=0, var_1_13=2147483647, var_1_14=-1, var_1_15=-1, var_1_16=1, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 10, 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, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 44 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:56:16,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...