/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_variablewrapping_normal_file-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:27:52,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:27:53,047 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 21:27:53,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:27:53,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:27:53,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:27:53,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:27:53,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:27:53,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:27:53,086 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:27:53,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:27:53,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:27:53,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:27:53,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:27:53,089 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:27:53,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:27:53,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:27:53,089 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:27:53,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:27:53,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:27:53,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:27:53,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:27:53,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:27:53,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:27:53,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:27:53,092 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:27:53,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:27:53,092 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:27:53,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:27:53,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:27:53,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:27:53,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:27:53,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:27:53,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:27:53,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:27:53,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:27:53,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:27:53,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:27:53,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:27:53,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:27:53,095 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:27:53,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:27:53,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:27:53,095 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 21:27:53,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:27:53,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:27:53,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:27:53,312 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:27:53,312 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:27:53,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-39.i [2023-12-15 21:27:54,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:27:54,550 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:27:54,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-39.i [2023-12-15 21:27:54,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a4646be/1946b76f5ddd410a97a6b16044e7492e/FLAGcdae76565 [2023-12-15 21:27:54,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a4646be/1946b76f5ddd410a97a6b16044e7492e [2023-12-15 21:27:54,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:27:54,584 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:27:54,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:27:54,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:27:54,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:27:54,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d799450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54, skipping insertion in model container [2023-12-15 21:27:54,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:27:54,728 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_variablewrapping_normal_file-39.i[913,926] [2023-12-15 21:27:54,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:27:54,762 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:27:54,771 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_variablewrapping_normal_file-39.i[913,926] [2023-12-15 21:27:54,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:27:54,798 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:27:54,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54 WrapperNode [2023-12-15 21:27:54,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:27:54,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:27:54,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:27:54,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:27:54,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,828 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-12-15 21:27:54,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:27:54,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:27:54,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:27:54,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:27:54,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,849 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 21:27:54,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:27:54,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:27:54,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:27:54,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:27:54,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (1/1) ... [2023-12-15 21:27:54,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:27:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:27:54,909 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 21:27:54,927 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 21:27:54,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:27:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:27:54,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:27:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:27:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:27:54,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:27:54,998 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:27:55,000 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:27:55,175 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:27:55,202 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:27:55,202 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:27:55,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:27:55 BoogieIcfgContainer [2023-12-15 21:27:55,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:27:55,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:27:55,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:27:55,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:27:55,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:27:54" (1/3) ... [2023-12-15 21:27:55,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3dd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:27:55, skipping insertion in model container [2023-12-15 21:27:55,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:27:54" (2/3) ... [2023-12-15 21:27:55,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3dd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:27:55, skipping insertion in model container [2023-12-15 21:27:55,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:27:55" (3/3) ... [2023-12-15 21:27:55,213 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-39.i [2023-12-15 21:27:55,272 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:27:55,272 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:27:55,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:27:55,352 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;@4e32cb1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:27:55,352 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:27:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:27:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 21:27:55,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:27:55,370 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:27:55,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:27:55,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:27:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1972672936, now seen corresponding path program 1 times [2023-12-15 21:27:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:27:55,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621430104] [2023-12-15 21:27:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:27:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:27:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:27:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:27:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:27:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:27:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:27:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:27:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:27:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:27:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:27:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:27:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 21:27:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 21:27:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 21:27:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:27:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:27:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 21:27:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:27:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:27:56,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:27:56,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621430104] [2023-12-15 21:27:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621430104] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:27:56,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:27:56,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:27:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80820322] [2023-12-15 21:27:56,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:27:56,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:27:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:27:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:27:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:27:56,646 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:27:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:27:57,165 INFO L93 Difference]: Finished difference Result 108 states and 185 transitions. [2023-12-15 21:27:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:27:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-12-15 21:27:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:27:57,174 INFO L225 Difference]: With dead ends: 108 [2023-12-15 21:27:57,174 INFO L226 Difference]: Without dead ends: 61 [2023-12-15 21:27:57,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:27:57,180 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:27:57,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 190 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:27:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-15 21:27:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2023-12-15 21:27:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:27:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2023-12-15 21:27:57,219 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 100 [2023-12-15 21:27:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:27:57,220 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2023-12-15 21:27:57,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:27:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2023-12-15 21:27:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 21:27:57,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:27:57,226 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:27:57,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:27:57,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:27:57,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:27:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash 691877015, now seen corresponding path program 1 times [2023-12-15 21:27:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:27:57,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433307563] [2023-12-15 21:27:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:27:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:27:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:27:57,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:27:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:27:57,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:27:57,377 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:27:57,378 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:27:57,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:27:57,382 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-15 21:27:57,385 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:27:57,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:27:57 BoogieIcfgContainer [2023-12-15 21:27:57,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:27:57,444 INFO L158 Benchmark]: Toolchain (without parser) took 2859.05ms. Allocated memory was 195.0MB in the beginning and 249.6MB in the end (delta: 54.5MB). Free memory was 150.4MB in the beginning and 110.8MB in the end (delta: 39.6MB). Peak memory consumption was 95.7MB. Max. memory is 8.0GB. [2023-12-15 21:27:57,445 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 195.0MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:27:57,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.90ms. Allocated memory is still 195.0MB. Free memory was 150.1MB in the beginning and 137.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 21:27:57,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.56ms. Allocated memory is still 195.0MB. Free memory was 137.5MB in the beginning and 135.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:27:57,448 INFO L158 Benchmark]: Boogie Preprocessor took 30.23ms. Allocated memory is still 195.0MB. Free memory was 135.1MB in the beginning and 132.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:27:57,449 INFO L158 Benchmark]: RCFGBuilder took 342.32ms. Allocated memory is still 195.0MB. Free memory was 132.7MB in the beginning and 115.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 21:27:57,449 INFO L158 Benchmark]: TraceAbstraction took 2239.07ms. Allocated memory was 195.0MB in the beginning and 249.6MB in the end (delta: 54.5MB). Free memory was 115.2MB in the beginning and 110.8MB in the end (delta: 4.4MB). Peak memory consumption was 60.1MB. Max. memory is 8.0GB. [2023-12-15 21:27:57,454 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.51ms. Allocated memory is still 195.0MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.90ms. Allocated memory is still 195.0MB. Free memory was 150.1MB in the beginning and 137.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.56ms. Allocated memory is still 195.0MB. Free memory was 137.5MB in the beginning and 135.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.23ms. Allocated memory is still 195.0MB. Free memory was 135.1MB in the beginning and 132.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 342.32ms. Allocated memory is still 195.0MB. Free memory was 132.7MB in the beginning and 115.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2239.07ms. Allocated memory was 195.0MB in the beginning and 249.6MB in the end (delta: 54.5MB). Free memory was 115.2MB in the beginning and 110.8MB in the end (delta: 4.4MB). Peak memory consumption was 60.1MB. 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 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] float var_1_7 = 1.1; [L29] float var_1_8 = 7.8; [L30] float var_1_9 = 1.75; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L72] var_1_7 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L73] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L74] var_1_8 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_9=7/4] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5, var_1_9=7/4] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L80] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L80] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L83] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L97] RET updateVariables() [L98] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L38] COND TRUE var_1_2 >= var_1_1 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=5] [L39] COND FALSE !(((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) [L42] var_1_6 = var_1_1 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=-16375] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=-16375] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073741815, stepLocal_1=8, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=-16375] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073741815, stepLocal_1=8, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=-16375] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=-16375] [L89-L90] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=-16375] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-16375, var_1_2=0, var_1_3=16383, var_1_4=16383, var_1_5=8, var_1_6=-16375] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 53 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=1, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 2118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 480/480 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 21:27:57,478 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...