/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_codestructure_steplocals_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 19:35:52,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 19:35:52,794 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 19:35:52,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 19:35:52,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 19:35:52,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 19:35:52,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 19:35:52,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 19:35:52,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 19:35:52,829 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 19:35:52,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 19:35:52,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 19:35:52,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 19:35:52,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 19:35:52,831 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 19:35:52,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 19:35:52,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 19:35:52,831 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 19:35:52,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 19:35:52,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 19:35:52,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 19:35:52,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 19:35:52,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 19:35:52,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 19:35:52,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 19:35:52,833 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 19:35:52,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 19:35:52,834 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 19:35:52,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 19:35:52,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 19:35:52,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 19:35:52,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 19:35:52,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:35:52,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 19:35:52,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 19:35:52,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 19:35:52,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 19:35:52,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 19:35:52,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 19:35:52,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 19:35:52,836 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 19:35:52,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 19:35:52,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 19:35:52,836 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 19:35:53,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 19:35:53,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 19:35:53,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 19:35:53,047 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 19:35:53,048 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 19:35:53,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2023-12-15 19:35:54,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 19:35:54,293 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 19:35:54,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2023-12-15 19:35:54,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b340bb4/bd5f85cc4657467da8f819d2f8a690b0/FLAG3dc8baecc [2023-12-15 19:35:54,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b340bb4/bd5f85cc4657467da8f819d2f8a690b0 [2023-12-15 19:35:54,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 19:35:54,317 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 19:35:54,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 19:35:54,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 19:35:54,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 19:35:54,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e14507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54, skipping insertion in model container [2023-12-15 19:35:54,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,351 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 19:35:54,469 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_codestructure_steplocals_file-30.i[917,930] [2023-12-15 19:35:54,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:35:54,523 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 19:35:54,530 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_codestructure_steplocals_file-30.i[917,930] [2023-12-15 19:35:54,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:35:54,562 INFO L206 MainTranslator]: Completed translation [2023-12-15 19:35:54,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54 WrapperNode [2023-12-15 19:35:54,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 19:35:54,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 19:35:54,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 19:35:54,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 19:35:54,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,594 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-12-15 19:35:54,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 19:35:54,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 19:35:54,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 19:35:54,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 19:35:54,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,611 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 19:35:54,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 19:35:54,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 19:35:54,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 19:35:54,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 19:35:54,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (1/1) ... [2023-12-15 19:35:54,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:35:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 19:35:54,645 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 19:35:54,647 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 19:35:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 19:35:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 19:35:54,664 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 19:35:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 19:35:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 19:35:54,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 19:35:54,742 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 19:35:54,743 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 19:35:54,945 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 19:35:54,964 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 19:35:54,964 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 19:35:54,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:35:54 BoogieIcfgContainer [2023-12-15 19:35:54,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 19:35:54,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 19:35:54,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 19:35:54,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 19:35:54,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 07:35:54" (1/3) ... [2023-12-15 19:35:54,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0bc4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:35:54, skipping insertion in model container [2023-12-15 19:35:54,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:35:54" (2/3) ... [2023-12-15 19:35:54,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0bc4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:35:54, skipping insertion in model container [2023-12-15 19:35:54,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:35:54" (3/3) ... [2023-12-15 19:35:54,970 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-30.i [2023-12-15 19:35:54,982 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 19:35:54,982 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 19:35:55,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 19:35:55,017 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;@2406f0bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 19:35:55,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 19:35:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 19:35:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 19:35:55,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:35:55,032 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:55,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:35:55,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:35:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1931576549, now seen corresponding path program 1 times [2023-12-15 19:35:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:35:55,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032713788] [2023-12-15 19:35:55,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:35:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:35:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:35:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:35:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:35:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:35:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:35:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:35:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:35:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:35:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:35:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 19:35:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 19:35:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 19:35:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 19:35:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 19:35:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 19:35:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 19:35:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 19:35:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 19:35:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 19:35:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:35:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032713788] [2023-12-15 19:35:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032713788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:35:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:35:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:35:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175649150] [2023-12-15 19:35:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:35:55,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 19:35:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:35:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 19:35:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 19:35:55,338 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 19:35:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:35:55,372 INFO L93 Difference]: Finished difference Result 125 states and 220 transitions. [2023-12-15 19:35:55,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 19:35:55,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-12-15 19:35:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:35:55,389 INFO L225 Difference]: With dead ends: 125 [2023-12-15 19:35:55,389 INFO L226 Difference]: Without dead ends: 62 [2023-12-15 19:35:55,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 19:35:55,393 INFO L413 NwaCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 19:35:55,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 19:35:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-15 19:35:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-15 19:35:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 19:35:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2023-12-15 19:35:55,421 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 118 [2023-12-15 19:35:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:35:55,421 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2023-12-15 19:35:55,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 19:35:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2023-12-15 19:35:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 19:35:55,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:35:55,423 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:55,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 19:35:55,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:35:55,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:35:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1134534385, now seen corresponding path program 1 times [2023-12-15 19:35:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:35:55,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267077673] [2023-12-15 19:35:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:35:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:35:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:35:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:35:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:35:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:35:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:35:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:35:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:35:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:35:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:35:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 19:35:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 19:35:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 19:35:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 19:35:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 19:35:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 19:35:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 19:35:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 19:35:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 19:35:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 19:35:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:35:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267077673] [2023-12-15 19:35:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267077673] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 19:35:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634202194] [2023-12-15 19:35:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:35:56,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 19:35:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 19:35:56,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 19:35:56,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 19:35:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:56,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 19:35:56,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 19:35:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-12-15 19:35:56,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 19:35:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 19:35:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634202194] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 19:35:56,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 19:35:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-15 19:35:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604057731] [2023-12-15 19:35:56,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 19:35:56,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 19:35:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:35:56,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 19:35:56,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 19:35:56,529 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-15 19:35:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:35:56,839 INFO L93 Difference]: Finished difference Result 176 states and 268 transitions. [2023-12-15 19:35:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 19:35:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 118 [2023-12-15 19:35:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:35:56,841 INFO L225 Difference]: With dead ends: 176 [2023-12-15 19:35:56,841 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 19:35:56,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2023-12-15 19:35:56,842 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 320 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 19:35:56,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 222 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 19:35:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 19:35:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2023-12-15 19:35:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 19:35:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2023-12-15 19:35:56,858 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 118 [2023-12-15 19:35:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:35:56,859 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2023-12-15 19:35:56,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-15 19:35:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2023-12-15 19:35:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 19:35:56,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:35:56,860 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:56,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 19:35:57,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 19:35:57,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:35:57,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:35:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash 100007560, now seen corresponding path program 1 times [2023-12-15 19:35:57,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:35:57,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670209240] [2023-12-15 19:35:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:35:57,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:35:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:35:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:35:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:35:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:35:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:35:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 19:35:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 19:35:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 19:35:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 19:35:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 19:35:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 19:35:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 19:35:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 19:35:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 19:35:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 19:35:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 19:35:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 19:35:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 19:35:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:35:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 19:35:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:35:57,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670209240] [2023-12-15 19:35:57,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670209240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:35:57,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:35:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 19:35:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656895422] [2023-12-15 19:35:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:35:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 19:35:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:35:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 19:35:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-15 19:35:57,354 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 19:35:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:35:57,530 INFO L93 Difference]: Finished difference Result 222 states and 332 transitions. [2023-12-15 19:35:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 19:35:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2023-12-15 19:35:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:35:57,535 INFO L225 Difference]: With dead ends: 222 [2023-12-15 19:35:57,535 INFO L226 Difference]: Without dead ends: 124 [2023-12-15 19:35:57,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2023-12-15 19:35:57,540 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 167 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 19:35:57,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 341 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 19:35:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-15 19:35:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2023-12-15 19:35:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 19:35:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2023-12-15 19:35:57,567 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 120 [2023-12-15 19:35:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:35:57,568 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2023-12-15 19:35:57,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 19:35:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2023-12-15 19:35:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 19:35:57,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:35:57,571 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:57,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 19:35:57,572 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:35:57,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:35:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash -921060794, now seen corresponding path program 1 times [2023-12-15 19:35:57,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:35:57,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225453786] [2023-12-15 19:35:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:35:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:35:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 19:35:57,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 19:35:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 19:35:57,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 19:35:57,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 19:35:57,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 19:35:57,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 19:35:57,683 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-15 19:35:57,690 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 19:35:57,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 07:35:57 BoogieIcfgContainer [2023-12-15 19:35:57,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 19:35:57,796 INFO L158 Benchmark]: Toolchain (without parser) took 3478.65ms. Allocated memory is still 326.1MB. Free memory was 277.1MB in the beginning and 240.2MB in the end (delta: 36.9MB). Peak memory consumption was 37.3MB. Max. memory is 8.0GB. [2023-12-15 19:35:57,796 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 174.1MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 19:35:57,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.44ms. Allocated memory is still 326.1MB. Free memory was 276.8MB in the beginning and 263.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 19:35:57,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.30ms. Allocated memory is still 326.1MB. Free memory was 263.4MB in the beginning and 261.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 19:35:57,796 INFO L158 Benchmark]: Boogie Preprocessor took 28.15ms. Allocated memory is still 326.1MB. Free memory was 261.0MB in the beginning and 258.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 19:35:57,796 INFO L158 Benchmark]: RCFGBuilder took 341.58ms. Allocated memory is still 326.1MB. Free memory was 258.2MB in the beginning and 239.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 19:35:57,797 INFO L158 Benchmark]: TraceAbstraction took 2829.12ms. Allocated memory is still 326.1MB. Free memory was 238.7MB in the beginning and 240.2MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 19:35:57,798 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 174.1MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.44ms. Allocated memory is still 326.1MB. Free memory was 276.8MB in the beginning and 263.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.30ms. Allocated memory is still 326.1MB. Free memory was 263.4MB in the beginning and 261.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.15ms. Allocated memory is still 326.1MB. Free memory was 261.0MB in the beginning and 258.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 341.58ms. Allocated memory is still 326.1MB. Free memory was 258.2MB in the beginning and 239.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2829.12ms. Allocated memory is still 326.1MB. Free memory was 238.7MB in the beginning and 240.2MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_2 = -256; [L24] signed long int var_1_3 = 256; [L25] unsigned char var_1_4 = 0; [L26] double var_1_5 = 127.5; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 10000000000000.125; [L29] double var_1_8 = 1.25; [L30] double var_1_9 = 4.125; [L31] double var_1_10 = 25.7; [L32] signed long int var_1_11 = -2; [L33] double var_1_12 = 49.75; [L34] signed long int var_1_13 = 5; [L35] signed long int var_1_14 = 128; [L36] signed long int var_1_15 = 1000; [L37] double var_1_16 = 0.2; [L38] double var_1_17 = 0.25; [L39] double var_1_18 = 99999999999999.5; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L97] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L99] var_1_3 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L100] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L102] var_1_4 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L103] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L105] var_1_6 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L106] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L108] var_1_7 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4, var_1_9=33/8] [L109] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4, var_1_9=33/8] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] 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=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L111] 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=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L112] var_1_10 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L113] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L114] var_1_12 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L115] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L116] var_1_13 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L117] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L118] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L118] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L119] var_1_14 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L120] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L121] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L121] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L122] var_1_17 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L123] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L124] var_1_18 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L125] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L138] RET updateVariables() [L139] CALL step() [L43] signed long int stepLocal_0 = var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16))); VAL [isInitial=1, stepLocal_0=4, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L44] COND FALSE !(stepLocal_0 >= var_1_3) VAL [isInitial=1, stepLocal_0=4, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L47] signed long int stepLocal_2 = var_1_3; [L48] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L49] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L50] COND FALSE !(var_1_2 >= stepLocal_2) [L55] var_1_5 = var_1_7 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=5/4] [L58] COND FALSE !(10.55f < var_1_5) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=5/4] [L63] COND TRUE var_1_5 > var_1_7 [L64] var_1_8 = var_1_10 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L69] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L70] COND FALSE !(((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L76] EXPR var_1_3 & var_1_13 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L76] COND FALSE !((- var_1_2) > (var_1_3 & var_1_13)) [L87] var_1_15 = var_1_13 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L89] COND TRUE ((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7 [L90] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR ((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L130-L131] return (((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 487 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 261 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 1787 SizeOfPredicates, 4 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2943/3060 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 19:35:57,832 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...