/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_dependencies_file-17.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 05:36:00,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 05:36:00,868 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 05:36:00,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 05:36:00,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 05:36:00,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 05:36:00,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 05:36:00,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 05:36:00,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 05:36:00,893 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 05:36:00,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 05:36:00,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 05:36:00,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 05:36:00,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 05:36:00,895 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 05:36:00,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 05:36:00,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 05:36:00,896 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 05:36:00,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 05:36:00,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 05:36:00,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 05:36:00,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 05:36:00,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 05:36:00,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 05:36:00,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 05:36:00,908 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 05:36:00,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 05:36:00,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 05:36:00,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 05:36:00,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 05:36:00,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 05:36:00,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 05:36:00,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:36:00,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 05:36:00,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 05:36:00,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 05:36:00,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 05:36:00,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 05:36:00,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 05:36:00,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 05:36:00,912 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 05:36:00,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 05:36:00,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 05:36:00,914 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 05:36:01,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 05:36:01,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 05:36:01,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 05:36:01,204 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 05:36:01,204 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 05:36:01,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-17.i [2023-12-19 05:36:02,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 05:36:02,646 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 05:36:02,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-17.i [2023-12-19 05:36:02,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618e1c987/62be57750f4b4142bd1d3f56fa1de871/FLAG539b6f437 [2023-12-19 05:36:02,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618e1c987/62be57750f4b4142bd1d3f56fa1de871 [2023-12-19 05:36:02,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 05:36:02,673 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 05:36:02,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 05:36:02,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 05:36:02,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 05:36:02,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:02,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1949ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02, skipping insertion in model container [2023-12-19 05:36:02,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:02,707 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 05:36:02,858 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_dependencies_file-17.i[919,932] [2023-12-19 05:36:02,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:36:02,921 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 05:36:02,932 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_dependencies_file-17.i[919,932] [2023-12-19 05:36:02,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:36:02,968 INFO L206 MainTranslator]: Completed translation [2023-12-19 05:36:02,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02 WrapperNode [2023-12-19 05:36:02,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 05:36:02,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 05:36:02,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 05:36:02,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 05:36:02,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:02,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,040 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2023-12-19 05:36:03,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 05:36:03,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 05:36:03,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 05:36:03,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 05:36:03,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,082 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 05:36:03,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 05:36:03,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 05:36:03,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 05:36:03,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 05:36:03,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (1/1) ... [2023-12-19 05:36:03,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:36:03,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 05:36:03,170 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 05:36:03,193 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 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 05:36:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 05:36:03,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 05:36:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 05:36:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 05:36:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 05:36:03,302 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 05:36:03,304 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 05:36:03,672 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 05:36:03,720 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 05:36:03,721 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 05:36:03,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:36:03 BoogieIcfgContainer [2023-12-19 05:36:03,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 05:36:03,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 05:36:03,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 05:36:03,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 05:36:03,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:36:02" (1/3) ... [2023-12-19 05:36:03,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f4ffc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:36:03, skipping insertion in model container [2023-12-19 05:36:03,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:02" (2/3) ... [2023-12-19 05:36:03,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f4ffc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:36:03, skipping insertion in model container [2023-12-19 05:36:03,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:36:03" (3/3) ... [2023-12-19 05:36:03,729 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-17.i [2023-12-19 05:36:03,743 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 05:36:03,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 05:36:03,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 05:36:03,786 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;@6c7598a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 05:36:03,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 05:36:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 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-19 05:36:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 05:36:03,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:03,803 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] [2023-12-19 05:36:03,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:03,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1995130847, now seen corresponding path program 1 times [2023-12-19 05:36:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918326819] [2023-12-19 05:36:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:36:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:36:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:36:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:36:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:36:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:36:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:36:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 05:36:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 05:36:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 05:36:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 05:36:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 05:36:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 05:36:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:36:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:36:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 05:36:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:36:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 05:36:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,269 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-19 05:36:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:36:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918326819] [2023-12-19 05:36:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918326819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:36:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:36:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 05:36:04,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213674714] [2023-12-19 05:36:04,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:36:04,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 05:36:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:36:04,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 05:36:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 05:36:04,319 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-19 05:36:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:36:04,370 INFO L93 Difference]: Finished difference Result 123 states and 216 transitions. [2023-12-19 05:36:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 05:36:04,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 114 [2023-12-19 05:36:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:36:04,381 INFO L225 Difference]: With dead ends: 123 [2023-12-19 05:36:04,382 INFO L226 Difference]: Without dead ends: 61 [2023-12-19 05:36:04,385 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-19 05:36:04,388 INFO L413 NwaCegarLoop]: 92 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, 92 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 05:36:04,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:36:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-19 05:36:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-19 05:36:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 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-19 05:36:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 95 transitions. [2023-12-19 05:36:04,447 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 95 transitions. Word has length 114 [2023-12-19 05:36:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:36:04,447 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 95 transitions. [2023-12-19 05:36:04,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-19 05:36:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 95 transitions. [2023-12-19 05:36:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 05:36:04,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:04,454 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] [2023-12-19 05:36:04,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 05:36:04,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:04,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 484602843, now seen corresponding path program 1 times [2023-12-19 05:36:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:04,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343681040] [2023-12-19 05:36:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:36:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:36:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:36:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:36:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:36:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:36:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:36:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 05:36:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 05:36:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 05:36:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 05:36:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 05:36:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 05:36:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:36:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:36:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 05:36:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:36:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 05:36:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:04,939 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-19 05:36:04,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:36:04,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343681040] [2023-12-19 05:36:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343681040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:36:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:36:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 05:36:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950234082] [2023-12-19 05:36:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:36:04,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 05:36:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:36:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 05:36:04,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:36:04,946 INFO L87 Difference]: Start difference. First operand 61 states and 95 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-19 05:36:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:36:05,143 INFO L93 Difference]: Finished difference Result 182 states and 284 transitions. [2023-12-19 05:36:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 05:36:05,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 114 [2023-12-19 05:36:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:36:05,148 INFO L225 Difference]: With dead ends: 182 [2023-12-19 05:36:05,148 INFO L226 Difference]: Without dead ends: 122 [2023-12-19 05:36:05,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 05:36:05,152 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 61 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:36:05,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 261 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:36:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-19 05:36:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2023-12-19 05:36:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 05:36:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2023-12-19 05:36:05,187 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 114 [2023-12-19 05:36:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:36:05,190 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2023-12-19 05:36:05,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-19 05:36:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2023-12-19 05:36:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 05:36:05,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:05,194 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] [2023-12-19 05:36:05,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 05:36:05,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:05,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:05,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1576911595, now seen corresponding path program 1 times [2023-12-19 05:36:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540992803] [2023-12-19 05:36:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:36:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:36:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:36:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:36:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:36:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:36:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:36:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 05:36:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 05:36:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 05:36:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 05:36:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 05:36:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 05:36:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:36:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:36:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 05:36:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:36:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 05:36:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 05:36:05,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:36:05,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540992803] [2023-12-19 05:36:05,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540992803] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 05:36:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729259191] [2023-12-19 05:36:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 05:36:05,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 05:36:05,918 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-19 05:36:05,929 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-19 05:36:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:06,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-19 05:36:06,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 05:36:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 317 proven. 21 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-12-19 05:36:06,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 05:36:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 05:36:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729259191] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 05:36:06,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 05:36:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-12-19 05:36:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018853915] [2023-12-19 05:36:06,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 05:36:06,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-19 05:36:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:36:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-19 05:36:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-19 05:36:06,774 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2023-12-19 05:36:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:36:07,798 INFO L93 Difference]: Finished difference Result 346 states and 507 transitions. [2023-12-19 05:36:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-19 05:36:07,799 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 115 [2023-12-19 05:36:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:36:07,802 INFO L225 Difference]: With dead ends: 346 [2023-12-19 05:36:07,802 INFO L226 Difference]: Without dead ends: 286 [2023-12-19 05:36:07,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2023-12-19 05:36:07,804 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 299 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 05:36:07,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 573 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 05:36:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-19 05:36:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 181. [2023-12-19 05:36:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 111 states have internal predecessors, (132), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 05:36:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2023-12-19 05:36:07,846 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 115 [2023-12-19 05:36:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:36:07,846 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2023-12-19 05:36:07,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2023-12-19 05:36:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2023-12-19 05:36:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 05:36:07,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:07,848 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] [2023-12-19 05:36:07,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 05:36:08,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 05:36:08,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:08,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash -767564969, now seen corresponding path program 1 times [2023-12-19 05:36:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462369546] [2023-12-19 05:36:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:36:08,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 05:36:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:36:08,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 05:36:08,233 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 05:36:08,234 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 05:36:08,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 05:36:08,238 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-19 05:36:08,241 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 05:36:08,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:36:08 BoogieIcfgContainer [2023-12-19 05:36:08,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 05:36:08,331 INFO L158 Benchmark]: Toolchain (without parser) took 5658.05ms. Allocated memory was 203.4MB in the beginning and 340.8MB in the end (delta: 137.4MB). Free memory was 150.1MB in the beginning and 228.9MB in the end (delta: -78.8MB). Peak memory consumption was 59.3MB. Max. memory is 8.0GB. [2023-12-19 05:36:08,331 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 05:36:08,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.23ms. Allocated memory is still 203.4MB. Free memory was 149.8MB in the beginning and 135.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 05:36:08,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.38ms. Allocated memory is still 203.4MB. Free memory was 135.8MB in the beginning and 131.9MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 05:36:08,332 INFO L158 Benchmark]: Boogie Preprocessor took 89.45ms. Allocated memory is still 203.4MB. Free memory was 131.9MB in the beginning and 126.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 05:36:08,333 INFO L158 Benchmark]: RCFGBuilder took 589.45ms. Allocated memory was 203.4MB in the beginning and 340.8MB in the end (delta: 137.4MB). Free memory was 126.7MB in the beginning and 295.7MB in the end (delta: -169.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-19 05:36:08,333 INFO L158 Benchmark]: TraceAbstraction took 4606.89ms. Allocated memory is still 340.8MB. Free memory was 295.5MB in the beginning and 228.9MB in the end (delta: 66.6MB). Peak memory consumption was 66.6MB. Max. memory is 8.0GB. [2023-12-19 05:36:08,335 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.14ms. Allocated memory is still 203.4MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.23ms. Allocated memory is still 203.4MB. Free memory was 149.8MB in the beginning and 135.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.38ms. Allocated memory is still 203.4MB. Free memory was 135.8MB in the beginning and 131.9MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.45ms. Allocated memory is still 203.4MB. Free memory was 131.9MB in the beginning and 126.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 589.45ms. Allocated memory was 203.4MB in the beginning and 340.8MB in the end (delta: 137.4MB). Free memory was 126.7MB in the beginning and 295.7MB in the end (delta: -169.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4606.89ms. Allocated memory is still 340.8MB. Free memory was 295.5MB in the beginning and 228.9MB in the end (delta: 66.6MB). Peak memory consumption was 66.6MB. 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 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] unsigned char last_1_var_1_8 = 1; [L40] signed char last_1_var_1_14 = -1; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_8 = var_1_8 [L114] last_1_var_1_14 = var_1_14 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L89] var_1_4 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L92] var_1_7 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L95] var_1_9 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L96] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L97] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L99] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L102] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L105] var_1_15 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L107] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L108] var_1_19 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L109] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L110] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L110] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L125] RET updateVariables() [L126] CALL step() [L44] COND TRUE last_1_var_1_8 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L45] COND TRUE \read(last_1_var_1_8) [L46] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L51] COND TRUE var_1_5 < var_1_3 [L52] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L56] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L57] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=128, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L62] COND TRUE (var_1_9 && var_1_8) || (var_1_8 && var_1_10) [L63] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=4294967287, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L67] COND TRUE var_1_4 == (8 + var_1_14) [L68] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=4294967287, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L70] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=4294967287, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=4294967287, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L117-L118] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=4294967287, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=126, var_1_16=8, var_1_18=4294967287, var_1_19=4294967294, var_1_1=57, var_1_2=7, var_1_3=7, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 926 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 680 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 766 IncrementalHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 246 mSDtfsCounter, 766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=3, InterpolantAutomatonStates: 31, 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, 131 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 6 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2997/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-19 05:36:08,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...