/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:34:07,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:34:07,830 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-16 03:34:07,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:34:07,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:34:07,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:34:07,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:34:07,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:34:07,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:34:07,870 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:34:07,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:34:07,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:34:07,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:34:07,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:34:07,873 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:34:07,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:34:07,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:34:07,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:34:07,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:34:07,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:34:07,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:34:07,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:34:07,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:34:07,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:34:07,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:34:07,876 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:34:07,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:34:07,877 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:34:07,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:34:07,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:34:07,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:34:07,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:34:07,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:34:07,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:34:07,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:34:07,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:34:07,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:34:07,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:34:07,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:34:07,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:34:07,880 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:34:07,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:34:07,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:34:07,881 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 -> false [2023-12-16 03:34:08,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:34:08,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:34:08,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:34:08,153 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:34:08,153 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:34:08,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-16 03:34:09,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:34:09,497 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:34:09,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-16 03:34:09,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca23e5156/d131b70ba2004841837c81563f2a852d/FLAGf7aa577c8 [2023-12-16 03:34:09,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca23e5156/d131b70ba2004841837c81563f2a852d [2023-12-16 03:34:09,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:34:09,526 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:34:09,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:34:09,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:34:09,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:34:09,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4872c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09, skipping insertion in model container [2023-12-16 03:34:09,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,566 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:34:09,718 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-12-16 03:34:09,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:34:09,782 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:34:09,798 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-12-16 03:34:09,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:34:09,838 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:34:09,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09 WrapperNode [2023-12-16 03:34:09,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:34:09,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:34:09,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:34:09,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:34:09,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,900 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2023-12-16 03:34:09,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:34:09,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:34:09,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:34:09,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:34:09,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,945 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-16 03:34:09,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:34:09,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:34:09,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:34:09,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:34:09,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (1/1) ... [2023-12-16 03:34:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:34:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:34:09,992 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-16 03:34:10,004 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-16 03:34:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:34:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:34:10,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:34:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:34:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:34:10,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:34:10,104 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:34:10,106 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:34:10,342 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:34:10,379 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:34:10,379 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:34:10,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:34:10 BoogieIcfgContainer [2023-12-16 03:34:10,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:34:10,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:34:10,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:34:10,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:34:10,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:34:09" (1/3) ... [2023-12-16 03:34:10,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc13886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:34:10, skipping insertion in model container [2023-12-16 03:34:10,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:09" (2/3) ... [2023-12-16 03:34:10,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc13886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:34:10, skipping insertion in model container [2023-12-16 03:34:10,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:34:10" (3/3) ... [2023-12-16 03:34:10,389 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-16 03:34:10,409 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:34:10,409 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:34:10,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:34:10,463 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;@1e77df96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:34:10,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:34:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 03:34:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-16 03:34:10,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:34:10,476 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:34:10,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:34:10,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:34:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1497251643, now seen corresponding path program 1 times [2023-12-16 03:34:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:34:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188547507] [2023-12-16 03:34:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:34:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:34:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:34:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:34:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:34:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:34:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:34:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:34:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:34:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:34:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:34:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:34:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:34:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:34:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 03:34:10,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:34:10,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188547507] [2023-12-16 03:34:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188547507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:34:10,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:34:10,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:34:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486738974] [2023-12-16 03:34:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:34:10,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:34:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:34:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:34:10,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:34:10,890 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 03:34:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:34:10,934 INFO L93 Difference]: Finished difference Result 79 states and 132 transitions. [2023-12-16 03:34:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:34:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2023-12-16 03:34:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:34:10,943 INFO L225 Difference]: With dead ends: 79 [2023-12-16 03:34:10,943 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 03:34:10,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-16 03:34:10,950 INFO L413 NwaCegarLoop]: 53 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, 53 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-16 03:34:10,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:34:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 03:34:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-16 03:34:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 03:34:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2023-12-16 03:34:10,995 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 80 [2023-12-16 03:34:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:34:10,996 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2023-12-16 03:34:10,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 03:34:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2023-12-16 03:34:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-16 03:34:11,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:34:11,003 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:34:11,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:34:11,003 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:34:11,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:34:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1796544315, now seen corresponding path program 1 times [2023-12-16 03:34:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:34:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775084080] [2023-12-16 03:34:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:34:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:34:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:34:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:34:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:34:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:34:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:34:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:34:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:34:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:34:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:34:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:34:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:34:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:34:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-16 03:34:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:34:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775084080] [2023-12-16 03:34:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775084080] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:34:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657791787] [2023-12-16 03:34:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:34:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:34:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:34:11,560 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-16 03:34:11,587 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-16 03:34:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:11,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 03:34:11,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:34:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 03:34:12,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:34:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-16 03:34:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657791787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:34:12,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:34:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2023-12-16 03:34:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474257017] [2023-12-16 03:34:12,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:34:12,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 03:34:12,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:34:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 03:34:12,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-12-16 03:34:12,182 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2023-12-16 03:34:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:34:12,580 INFO L93 Difference]: Finished difference Result 141 states and 196 transitions. [2023-12-16 03:34:12,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 03:34:12,580 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 80 [2023-12-16 03:34:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:34:12,582 INFO L225 Difference]: With dead ends: 141 [2023-12-16 03:34:12,583 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 03:34:12,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2023-12-16 03:34:12,585 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 206 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:34:12,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 309 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:34:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 03:34:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2023-12-16 03:34:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 03:34:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2023-12-16 03:34:12,604 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 80 [2023-12-16 03:34:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:34:12,605 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2023-12-16 03:34:12,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2023-12-16 03:34:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2023-12-16 03:34:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-16 03:34:12,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:34:12,606 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:34:12,619 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-16 03:34:12,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:34:12,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:34:12,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:34:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2054709753, now seen corresponding path program 1 times [2023-12-16 03:34:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:34:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675256473] [2023-12-16 03:34:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:34:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:34:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:34:12,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:34:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:34:12,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:34:12,922 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:34:12,926 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:34:12,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:34:12,931 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-16 03:34:12,955 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:34:13,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:34:13 BoogieIcfgContainer [2023-12-16 03:34:13,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:34:13,020 INFO L158 Benchmark]: Toolchain (without parser) took 3493.35ms. Allocated memory is still 253.8MB. Free memory was 216.9MB in the beginning and 214.4MB in the end (delta: 2.5MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. [2023-12-16 03:34:13,020 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory was 134.1MB in the beginning and 134.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:34:13,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.83ms. Allocated memory is still 253.8MB. Free memory was 216.9MB in the beginning and 204.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:34:13,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.65ms. Allocated memory is still 253.8MB. Free memory was 204.4MB in the beginning and 201.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:34:13,021 INFO L158 Benchmark]: Boogie Preprocessor took 57.01ms. Allocated memory is still 253.8MB. Free memory was 201.7MB in the beginning and 199.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:34:13,021 INFO L158 Benchmark]: RCFGBuilder took 420.41ms. Allocated memory is still 253.8MB. Free memory was 199.1MB in the beginning and 181.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 03:34:13,022 INFO L158 Benchmark]: TraceAbstraction took 2636.43ms. Allocated memory is still 253.8MB. Free memory was 180.2MB in the beginning and 214.4MB in the end (delta: -34.1MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2023-12-16 03:34:13,023 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 188.7MB. Free memory was 134.1MB in the beginning and 134.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.83ms. Allocated memory is still 253.8MB. Free memory was 216.9MB in the beginning and 204.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.65ms. Allocated memory is still 253.8MB. Free memory was 204.4MB in the beginning and 201.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.01ms. Allocated memory is still 253.8MB. Free memory was 201.7MB in the beginning and 199.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 420.41ms. Allocated memory is still 253.8MB. Free memory was 199.1MB in the beginning and 181.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2636.43ms. Allocated memory is still 253.8MB. Free memory was 180.2MB in the beginning and 214.4MB in the end (delta: -34.1MB). Peak memory consumption was 91.2MB. 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 bitwise operation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] signed long int var_1_9 = 256; [L27] signed long int var_1_10 = 0; [L28] signed long int var_1_11 = 0; [L29] signed long int var_1_12 = 49; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] signed long int var_1_15 = 0; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L84] last_1_var_1_13 = var_1_13 [L94] RET updateLastVariables() [L95] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=256] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=256] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=256] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=256] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=256] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L70] var_1_10 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L71] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L73] var_1_11 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L75] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L75] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=49, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L79] var_1_14 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L81] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L81] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L95] RET updateVariables() [L96] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_14=0, var_1_15=0, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L52] var_1_15 = var_1_11 [L53] EXPR var_1_13 ^ var_1_7 [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND TRUE stepLocal_0 < -1 [L55] var_1_1 = 8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=-2, stepLocal_1=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=200, var_1_1=8, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L59] EXPR var_1_7 | var_1_16 [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=-2, stepLocal_1=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=200, var_1_1=8, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR var_1_13 ^ var_1_7 [L87] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((signed long int) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) [L87] EXPR var_1_7 | var_1_16 [L87] EXPR var_1_13 & (var_1_7 | var_1_16) [L87] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((signed long int) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=200, var_1_1=8, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L87-L88] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((signed long int) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((signed long int) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=200, var_1_1=8, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=-8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=200, var_1_1=8, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 362 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 92 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 36 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 1093 SizeOfPredicates, 5 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 957/1056 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-16 03:34:13,050 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...