/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-57.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 14:49:43,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:49:43,797 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 14:49:43,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:49:43,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:49:43,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:49:43,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:49:43,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:49:43,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:49:43,830 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:49:43,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:49:43,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:49:43,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:49:43,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:49:43,832 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:49:43,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:49:43,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:49:43,832 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:49:43,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:49:43,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:49:43,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:49:43,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:49:43,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:49:43,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:49:43,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:49:43,834 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:49:43,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:49:43,835 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:49:43,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:49:43,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:49:43,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:49:43,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:49:43,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:49:43,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:49:43,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:49:43,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:49:43,838 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 14:49:44,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:49:44,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:49:44,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:49:44,028 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:49:44,028 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:49:44,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2023-12-19 14:49:45,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:49:45,354 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:49:45,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2023-12-19 14:49:45,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94eac964e/7cd293849ce041f79d73199870dce434/FLAG58a59d862 [2023-12-19 14:49:45,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94eac964e/7cd293849ce041f79d73199870dce434 [2023-12-19 14:49:45,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:49:45,375 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:49:45,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:49:45,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:49:45,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:49:45,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56efcae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45, skipping insertion in model container [2023-12-19 14:49:45,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,411 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:49:45,527 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-57.i[913,926] [2023-12-19 14:49:45,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:49:45,584 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 14:49:45,595 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-57.i[913,926] [2023-12-19 14:49:45,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:49:45,633 INFO L206 MainTranslator]: Completed translation [2023-12-19 14:49:45,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45 WrapperNode [2023-12-19 14:49:45,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 14:49:45,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 14:49:45,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 14:49:45,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 14:49:45,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,685 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2023-12-19 14:49:45,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 14:49:45,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 14:49:45,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 14:49:45,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 14:49:45,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,719 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 14:49:45,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 14:49:45,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 14:49:45,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 14:49:45,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 14:49:45,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (1/1) ... [2023-12-19 14:49:45,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:49:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:49:45,778 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 14:49:45,813 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 14:49:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 14:49:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 14:49:45,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 14:49:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 14:49:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 14:49:45,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 14:49:45,871 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 14:49:45,873 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 14:49:46,026 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 14:49:46,080 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 14:49:46,081 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 14:49:46,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:49:46 BoogieIcfgContainer [2023-12-19 14:49:46,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 14:49:46,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 14:49:46,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 14:49:46,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 14:49:46,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:49:45" (1/3) ... [2023-12-19 14:49:46,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568f74ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:49:46, skipping insertion in model container [2023-12-19 14:49:46,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:49:45" (2/3) ... [2023-12-19 14:49:46,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568f74ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:49:46, skipping insertion in model container [2023-12-19 14:49:46,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:49:46" (3/3) ... [2023-12-19 14:49:46,087 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-57.i [2023-12-19 14:49:46,112 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 14:49:46,112 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 14:49:46,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 14:49:46,165 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;@4d95d207, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 14:49:46,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 14:49:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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 14:49:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 14:49:46,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:49:46,179 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] [2023-12-19 14:49:46,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:49:46,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:49:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -669129977, now seen corresponding path program 1 times [2023-12-19 14:49:46,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:49:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986471262] [2023-12-19 14:49:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:49:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:49:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:49:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:49:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:49:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:49:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:49:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:49:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 14:49:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 14:49:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 14:49:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 14:49:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 14:49:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:49:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:49:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 14:49:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 14:49:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 14:49:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 14:49:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:49:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,532 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 14:49:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:49:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986471262] [2023-12-19 14:49:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986471262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:49:46,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:49:46,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 14:49:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322477619] [2023-12-19 14:49:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:49:46,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 14:49:46,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:49:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 14:49:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:49:46,563 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 14:49:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:49:46,610 INFO L93 Difference]: Finished difference Result 91 states and 160 transitions. [2023-12-19 14:49:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 14:49:46,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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 109 [2023-12-19 14:49:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:49:46,617 INFO L225 Difference]: With dead ends: 91 [2023-12-19 14:49:46,617 INFO L226 Difference]: Without dead ends: 45 [2023-12-19 14:49:46,619 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 14:49:46,621 INFO L413 NwaCegarLoop]: 64 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, 64 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 14:49:46,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:49:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-19 14:49:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-19 14:49:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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 14:49:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2023-12-19 14:49:46,651 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 109 [2023-12-19 14:49:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:49:46,652 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-12-19 14:49:46,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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 14:49:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2023-12-19 14:49:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 14:49:46,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:49:46,655 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] [2023-12-19 14:49:46,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 14:49:46,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:49:46,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:49:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1043084857, now seen corresponding path program 1 times [2023-12-19 14:49:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:49:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499748104] [2023-12-19 14:49:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:49:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:49:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:49:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:49:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:49:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:49:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:49:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:49:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 14:49:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 14:49:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 14:49:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 14:49:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 14:49:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:49:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:49:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 14:49:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 14:49:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 14:49:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 14:49:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:47,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:49:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:49:47,026 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 14:49:47,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:49:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499748104] [2023-12-19 14:49:47,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499748104] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:49:47,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:49:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:49:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393296073] [2023-12-19 14:49:47,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:49:47,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:49:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:49:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:49:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:49:47,029 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 14:49:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:49:47,151 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2023-12-19 14:49:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 14:49:47,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 109 [2023-12-19 14:49:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:49:47,156 INFO L225 Difference]: With dead ends: 134 [2023-12-19 14:49:47,157 INFO L226 Difference]: Without dead ends: 90 [2023-12-19 14:49:47,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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 14:49:47,162 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:49:47,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:49:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-19 14:49:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-12-19 14:49:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 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 14:49:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 117 transitions. [2023-12-19 14:49:47,200 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 117 transitions. Word has length 109 [2023-12-19 14:49:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:49:47,202 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 117 transitions. [2023-12-19 14:49:47,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 14:49:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 117 transitions. [2023-12-19 14:49:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 14:49:47,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:49:47,208 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] [2023-12-19 14:49:47,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 14:49:47,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:49:47,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:49:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1494859976, now seen corresponding path program 1 times [2023-12-19 14:49:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:49:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623806531] [2023-12-19 14:49:47,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:49:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:49:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:49:47,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 14:49:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:49:47,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 14:49:47,422 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 14:49:47,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 14:49:47,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 14:49:47,427 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-19 14:49:47,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 14:49:47,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:49:47 BoogieIcfgContainer [2023-12-19 14:49:47,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 14:49:47,498 INFO L158 Benchmark]: Toolchain (without parser) took 2123.08ms. Allocated memory is still 300.9MB. Free memory was 252.7MB in the beginning and 175.5MB in the end (delta: 77.2MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2023-12-19 14:49:47,498 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory was 152.2MB in the beginning and 152.0MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:49:47,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.53ms. Allocated memory is still 300.9MB. Free memory was 252.6MB in the beginning and 240.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 14:49:47,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.62ms. Allocated memory is still 300.9MB. Free memory was 240.0MB in the beginning and 237.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 14:49:47,499 INFO L158 Benchmark]: Boogie Preprocessor took 52.15ms. Allocated memory is still 300.9MB. Free memory was 237.9MB in the beginning and 235.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 14:49:47,501 INFO L158 Benchmark]: RCFGBuilder took 342.05ms. Allocated memory is still 300.9MB. Free memory was 235.3MB in the beginning and 217.1MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 14:49:47,502 INFO L158 Benchmark]: TraceAbstraction took 1415.01ms. Allocated memory is still 300.9MB. Free memory was 216.5MB in the beginning and 175.5MB in the end (delta: 40.9MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. [2023-12-19 14:49:47,515 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.12ms. Allocated memory is still 198.2MB. Free memory was 152.2MB in the beginning and 152.0MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.53ms. Allocated memory is still 300.9MB. Free memory was 252.6MB in the beginning and 240.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.62ms. Allocated memory is still 300.9MB. Free memory was 240.0MB in the beginning and 237.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.15ms. Allocated memory is still 300.9MB. Free memory was 237.9MB in the beginning and 235.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 342.05ms. Allocated memory is still 300.9MB. Free memory was 235.3MB in the beginning and 217.1MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1415.01ms. Allocated memory is still 300.9MB. Free memory was 216.5MB in the beginning and 175.5MB in the end (delta: 40.9MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 1; [L26] signed char var_1_9 = 64; [L27] signed char var_1_10 = 4; [L28] signed char var_1_11 = -4; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 32; [L31] signed char var_1_14 = -64; [L32] signed char var_1_15 = 50; [L33] signed char var_1_16 = 16; [L34] float var_1_17 = 63.5; [L35] signed char last_1_var_1_9 = 64; [L36] signed char last_1_var_1_14 = -64; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_9 = var_1_9 [L98] last_1_var_1_14 = var_1_14 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L68] var_1_4 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L69] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L76] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L77] var_1_10 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L78] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L79] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L79] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L80] var_1_11 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L81] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L82] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L82] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L84] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L89] var_1_15 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L91] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L91] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L94] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L94] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L109] RET updateVariables() [L110] CALL step() [L40] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=1, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L41] COND TRUE ! (last_1_var_1_14 >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=1, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L42] COND TRUE (var_1_4 || var_1_5) && stepLocal_0 [L43] var_1_1 = ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=1, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L50] signed long int stepLocal_3 = (var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))); VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=1, stepLocal_3=1, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-64, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L51] COND TRUE var_1_12 < stepLocal_3 [L52] var_1_14 = ((64 - var_1_16) - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=1, stepLocal_3=1, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-1, var_1_15=63, var_1_16=2, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L56] var_1_17 = 128.91f [L57] unsigned char stepLocal_2 = var_1_14 == var_1_1; [L58] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=1, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-1, var_1_15=63, var_1_16=2, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L59] COND FALSE !(stepLocal_1 && var_1_4) [L64] var_1_9 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=1, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-1, var_1_15=63, var_1_16=2, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=-63] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? (((var_1_4 || var_1_5) && var_1_6) ? (var_1_1 == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : (var_1_1 == ((signed long int) last_1_var_1_14))) : (var_1_1 == ((signed long int) last_1_var_1_14))) && ((var_1_5 && var_1_4) ? ((var_1_6 || (var_1_14 == var_1_1)) ? (var_1_9 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))) : 1) : (var_1_9 == ((signed char) (var_1_12 - var_1_13))))) && ((var_1_12 < ((var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))))) ? (var_1_14 == ((signed char) ((64 - var_1_16) - var_1_13))) : (var_1_14 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))))) && (var_1_17 == ((float) 128.91f)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-1, var_1_15=63, var_1_16=2, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=-63] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=4, var_1_12=0, var_1_13=63, var_1_14=-1, var_1_15=63, var_1_16=2, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 125 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 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 14:49:47,555 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...