/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_floatingpointinfluence_no-floats_file-49.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 10:50:03,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 10:50:03,227 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-19 10:50:03,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 10:50:03,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 10:50:03,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 10:50:03,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 10:50:03,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 10:50:03,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 10:50:03,244 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 10:50:03,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 10:50:03,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 10:50:03,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 10:50:03,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 10:50:03,246 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 10:50:03,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 10:50:03,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 10:50:03,246 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 10:50:03,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 10:50:03,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 10:50:03,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 10:50:03,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 10:50:03,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 10:50:03,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 10:50:03,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 10:50:03,249 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 10:50:03,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 10:50:03,249 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 10:50:03,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 10:50:03,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 10:50:03,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 10:50:03,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 10:50:03,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:50:03,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 10:50:03,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 10:50:03,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 10:50:03,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 10:50:03,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 10:50:03,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 10:50:03,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 10:50:03,252 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 10:50:03,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 10:50:03,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 10:50:03,253 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-19 10:50:03,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 10:50:03,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 10:50:03,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 10:50:03,474 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 10:50:03,475 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 10:50:03,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2023-12-19 10:50:04,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 10:50:04,724 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 10:50:04,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2023-12-19 10:50:04,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd82a6001/b8da8265444447e6a0482b4b92dd7154/FLAGd19507ccb [2023-12-19 10:50:04,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd82a6001/b8da8265444447e6a0482b4b92dd7154 [2023-12-19 10:50:04,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 10:50:04,760 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 10:50:04,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 10:50:04,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 10:50:04,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 10:50:04,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:04,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe3a90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04, skipping insertion in model container [2023-12-19 10:50:04,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:04,793 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 10:50:04,906 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_floatingpointinfluence_no-floats_file-49.i[916,929] [2023-12-19 10:50:04,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:50:04,947 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 10:50:04,955 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_floatingpointinfluence_no-floats_file-49.i[916,929] [2023-12-19 10:50:04,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:50:04,999 INFO L206 MainTranslator]: Completed translation [2023-12-19 10:50:04,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04 WrapperNode [2023-12-19 10:50:04,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 10:50:05,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 10:50:05,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 10:50:05,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 10:50:05,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,056 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2023-12-19 10:50:05,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 10:50:05,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 10:50:05,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 10:50:05,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 10:50:05,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,080 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-19 10:50:05,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 10:50:05,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 10:50:05,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 10:50:05,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 10:50:05,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (1/1) ... [2023-12-19 10:50:05,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:50:05,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:50:05,182 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-19 10:50:05,190 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-19 10:50:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 10:50:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 10:50:05,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 10:50:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 10:50:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 10:50:05,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 10:50:05,305 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 10:50:05,307 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 10:50:05,541 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 10:50:05,584 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 10:50:05,585 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 10:50:05,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:50:05 BoogieIcfgContainer [2023-12-19 10:50:05,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 10:50:05,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 10:50:05,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 10:50:05,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 10:50:05,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 10:50:04" (1/3) ... [2023-12-19 10:50:05,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efaccfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:50:05, skipping insertion in model container [2023-12-19 10:50:05,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:50:04" (2/3) ... [2023-12-19 10:50:05,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efaccfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:50:05, skipping insertion in model container [2023-12-19 10:50:05,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:50:05" (3/3) ... [2023-12-19 10:50:05,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-49.i [2023-12-19 10:50:05,619 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 10:50:05,619 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 10:50:05,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 10:50:05,688 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;@627df689, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 10:50:05,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 10:50:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 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-19 10:50:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 10:50:05,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:50:05,708 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] [2023-12-19 10:50:05,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:50:05,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:50:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -187152588, now seen corresponding path program 1 times [2023-12-19 10:50:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:50:05,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879337077] [2023-12-19 10:50:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:50:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:50:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:05,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:50:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:50:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:50:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:50:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:50:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:50:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:50:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:50:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:50:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:50:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:50:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:50:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:50:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:50:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:50:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:50:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,136 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-19 10:50:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:50:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879337077] [2023-12-19 10:50:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879337077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:50:06,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:50:06,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 10:50:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078954509] [2023-12-19 10:50:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:50:06,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 10:50:06,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:50:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 10:50:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:50:06,195 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 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 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 10:50:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:50:06,242 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2023-12-19 10:50:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 10:50:06,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2023-12-19 10:50:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:50:06,250 INFO L225 Difference]: With dead ends: 93 [2023-12-19 10:50:06,251 INFO L226 Difference]: Without dead ends: 46 [2023-12-19 10:50:06,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-19 10:50:06,255 INFO L413 NwaCegarLoop]: 67 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, 67 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-19 10:50:06,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:50:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-19 10:50:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-19 10:50:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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-19 10:50:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2023-12-19 10:50:06,305 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 99 [2023-12-19 10:50:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:50:06,306 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2023-12-19 10:50:06,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 10:50:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2023-12-19 10:50:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 10:50:06,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:50:06,309 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] [2023-12-19 10:50:06,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 10:50:06,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:50:06,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:50:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1259395276, now seen corresponding path program 1 times [2023-12-19 10:50:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:50:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188737477] [2023-12-19 10:50:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:50:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:50:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:50:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:50:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:50:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:50:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:50:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:50:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:50:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:50:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:50:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:50:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:50:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:50:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:50:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:50:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:50:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:50:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:50:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 10:50:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:50:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188737477] [2023-12-19 10:50:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188737477] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:50:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:50:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 10:50:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060914327] [2023-12-19 10:50:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:50:06,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 10:50:06,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:50:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 10:50:06,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:50:06,737 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 10:50:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:50:06,948 INFO L93 Difference]: Finished difference Result 99 states and 146 transitions. [2023-12-19 10:50:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 10:50:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-12-19 10:50:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:50:06,952 INFO L225 Difference]: With dead ends: 99 [2023-12-19 10:50:06,952 INFO L226 Difference]: Without dead ends: 54 [2023-12-19 10:50:06,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:50:06,953 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 53 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:50:06,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 104 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:50:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-19 10:50:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-12-19 10:50:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 10:50:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2023-12-19 10:50:06,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 99 [2023-12-19 10:50:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:50:06,968 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2023-12-19 10:50:06,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 10:50:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2023-12-19 10:50:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 10:50:06,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:50:06,971 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-19 10:50:06,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 10:50:06,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:50:06,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:50:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash 435347964, now seen corresponding path program 1 times [2023-12-19 10:50:06,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:50:06,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960414299] [2023-12-19 10:50:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:50:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:50:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:50:07,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 10:50:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:50:07,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 10:50:07,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 10:50:07,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 10:50:07,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 10:50:07,144 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-19 10:50:07,148 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 10:50:07,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 10:50:07 BoogieIcfgContainer [2023-12-19 10:50:07,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 10:50:07,210 INFO L158 Benchmark]: Toolchain (without parser) took 2449.42ms. Allocated memory is still 272.6MB. Free memory was 219.6MB in the beginning and 106.9MB in the end (delta: 112.7MB). Peak memory consumption was 113.7MB. Max. memory is 8.0GB. [2023-12-19 10:50:07,210 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 10:50:07,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.82ms. Allocated memory is still 272.6MB. Free memory was 219.3MB in the beginning and 205.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 10:50:07,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.86ms. Allocated memory is still 272.6MB. Free memory was 205.7MB in the beginning and 201.7MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 10:50:07,211 INFO L158 Benchmark]: Boogie Preprocessor took 51.75ms. Allocated memory is still 272.6MB. Free memory was 201.7MB in the beginning and 193.9MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-19 10:50:07,212 INFO L158 Benchmark]: RCFGBuilder took 476.27ms. Allocated memory is still 272.6MB. Free memory was 193.9MB in the beginning and 222.3MB in the end (delta: -28.4MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2023-12-19 10:50:07,212 INFO L158 Benchmark]: TraceAbstraction took 1621.87ms. Allocated memory is still 272.6MB. Free memory was 221.7MB in the beginning and 106.9MB in the end (delta: 114.8MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. [2023-12-19 10:50:07,214 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.10ms. Allocated memory is still 185.6MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.82ms. Allocated memory is still 272.6MB. Free memory was 219.3MB in the beginning and 205.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.86ms. Allocated memory is still 272.6MB. Free memory was 205.7MB in the beginning and 201.7MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.75ms. Allocated memory is still 272.6MB. Free memory was 201.7MB in the beginning and 193.9MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 476.27ms. Allocated memory is still 272.6MB. Free memory was 193.9MB in the beginning and 222.3MB in the end (delta: -28.4MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1621.87ms. Allocated memory is still 272.6MB. Free memory was 221.7MB in the beginning and 106.9MB in the end (delta: 114.8MB). Peak memory consumption was 114.3MB. 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 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] signed long int var_1_2 = 1000000000; [L24] signed long int var_1_3 = 1000; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 4; [L27] unsigned short int var_1_6 = 10; [L28] signed short int var_1_8 = 128; [L29] signed short int var_1_9 = -2; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 1; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L66] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L68] var_1_3 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L69] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L74] var_1_5 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L76] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L76] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L77] var_1_6 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_8=128, var_1_9=-2] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_8=128, var_1_9=-2] [L79] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-2] [L79] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-2] [L80] var_1_9 = __VERIFIER_nondet_short() [L81] CALL assume_abort_if_not(var_1_9 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L81] RET assume_abort_if_not(var_1_9 >= -32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L82] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L82] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L85] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L85] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L86] var_1_12 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L87] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L88] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L88] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-32766] [L101] RET updateVariables() [L102] CALL step() [L37] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L38] EXPR 50 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L38] COND TRUE (50 >> var_1_4) <= var_1_8 [L39] var_1_10 = ((! (! var_1_11)) || var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L43] COND TRUE ! var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L44] COND TRUE var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) [L45] var_1_13 = (var_1_10 && var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L50] COND FALSE !(var_1_2 >= 64.5f) [L61] var_1_1 = 50 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L93-L94] return ((((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11))))) && ((! var_1_12) ? ((var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8)))) ? (var_1_13 == ((unsigned char) (var_1_10 && var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=-32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 113 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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-19 10:50:07,250 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...