/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_variablewrapping_wrapper-a_file-19.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:18:13,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:18:13,612 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 04:18:13,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:18:13,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:18:13,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:18:13,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:18:13,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:18:13,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:18:13,660 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:18:13,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:18:13,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:18:13,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:18:13,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:18:13,663 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:18:13,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:18:13,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:18:13,664 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:18:13,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:18:13,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:18:13,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:18:13,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:18:13,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:18:13,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:18:13,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:18:13,667 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:18:13,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:18:13,667 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:18:13,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:18:13,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:18:13,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:18:13,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:18:13,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:13,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:18:13,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:18:13,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:18:13,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:18:13,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:18:13,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:18:13,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:18:13,671 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:18:13,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:18:13,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:18:13,671 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 04:18:13,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:18:13,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:18:13,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:18:13,939 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:18:13,940 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:18:13,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2023-12-16 04:18:15,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:18:15,289 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:18:15,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2023-12-16 04:18:15,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0f497ca/3c4f5275d898478d86744331b3b53839/FLAGf9fedb196 [2023-12-16 04:18:15,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0f497ca/3c4f5275d898478d86744331b3b53839 [2023-12-16 04:18:15,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:18:15,312 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:18:15,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:15,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:18:15,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:18:15,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2488ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15, skipping insertion in model container [2023-12-16 04:18:15,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:18:15,506 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_wrapper-a_file-19.i[916,929] [2023-12-16 04:18:15,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:15,578 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:18:15,589 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_wrapper-a_file-19.i[916,929] [2023-12-16 04:18:15,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:15,638 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:18:15,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15 WrapperNode [2023-12-16 04:18:15,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:15,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:15,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:18:15,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:18:15,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,699 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2023-12-16 04:18:15,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:15,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:18:15,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:18:15,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:18:15,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,736 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2023-12-16 04:18:15,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:18:15,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:18:15,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:18:15,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:18:15,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (1/1) ... [2023-12-16 04:18:15,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:15,814 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 04:18:15,839 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 04:18:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:18:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:18:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:18:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:18:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:18:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:18:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:18:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:18:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:18:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:18:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:18:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:18:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:18:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:18:15,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:18:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:18:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:18:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:18:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:18:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:18:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:18:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:18:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:18:15,989 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:18:15,994 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:18:16,466 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:18:16,499 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:18:16,500 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:18:16,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:16 BoogieIcfgContainer [2023-12-16 04:18:16,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:18:16,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:18:16,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:18:16,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:18:16,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:18:15" (1/3) ... [2023-12-16 04:18:16,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385a12ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:16, skipping insertion in model container [2023-12-16 04:18:16,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:15" (2/3) ... [2023-12-16 04:18:16,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385a12ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:16, skipping insertion in model container [2023-12-16 04:18:16,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:16" (3/3) ... [2023-12-16 04:18:16,508 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-19.i [2023-12-16 04:18:16,524 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:18:16,524 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:18:16,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:18:16,571 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;@25ca1223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:18:16,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:18:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:18:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 04:18:16,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:16,587 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:16,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:16,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash -31477708, now seen corresponding path program 1 times [2023-12-16 04:18:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787033222] [2023-12-16 04:18:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787033222] [2023-12-16 04:18:16,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:18:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855037047] [2023-12-16 04:18:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:16,878 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 04:18:16,904 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 04:18:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:17,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 04:18:17,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2023-12-16 04:18:17,163 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855037047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:18:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134941303] [2023-12-16 04:18:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:17,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:18:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:17,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:18:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:17,207 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:18:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:17,257 INFO L93 Difference]: Finished difference Result 177 states and 283 transitions. [2023-12-16 04:18:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:18:17,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 124 [2023-12-16 04:18:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:17,268 INFO L225 Difference]: With dead ends: 177 [2023-12-16 04:18:17,268 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 04:18:17,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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 04:18:17,274 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:17,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 04:18:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-16 04:18:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:18:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2023-12-16 04:18:17,343 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 124 [2023-12-16 04:18:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:17,343 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2023-12-16 04:18:17,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:18:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2023-12-16 04:18:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 04:18:17,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:17,352 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:17,364 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 04:18:17,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 04:18:17,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:17,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1077529134, now seen corresponding path program 1 times [2023-12-16 04:18:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312582894] [2023-12-16 04:18:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:17,650 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:17,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525662172] [2023-12-16 04:18:17,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:17,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:17,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:18:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:17,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 04:18:17,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:17,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2023-12-16 04:18:17,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2023-12-16 04:18:17,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 04:18:18,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 119 [2023-12-16 04:18:18,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 83 [2023-12-16 04:18:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:18:18,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:18:18,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2023-12-16 04:18:18,311 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-12-16 04:18:18,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-12-16 04:18:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:18:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312582894] [2023-12-16 04:18:18,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525662172] [2023-12-16 04:18:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525662172] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:18:18,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:18:18,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-12-16 04:18:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554512669] [2023-12-16 04:18:18,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:18,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:18,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:18,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:18:18,374 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:18:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:18,754 INFO L93 Difference]: Finished difference Result 277 states and 396 transitions. [2023-12-16 04:18:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:18:18,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2023-12-16 04:18:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:18,757 INFO L225 Difference]: With dead ends: 277 [2023-12-16 04:18:18,757 INFO L226 Difference]: Without dead ends: 190 [2023-12-16 04:18:18,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:18:18,759 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 219 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:18,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 754 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-16 04:18:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 153. [2023-12-16 04:18:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 121 states have internal predecessors, (158), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:18:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2023-12-16 04:18:18,788 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 124 [2023-12-16 04:18:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:18,792 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2023-12-16 04:18:18,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:18:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2023-12-16 04:18:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 04:18:18,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:18,796 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:18,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:19,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 04:18:19,003 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:19,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2088646384, now seen corresponding path program 1 times [2023-12-16 04:18:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32437150] [2023-12-16 04:18:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:19,061 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328344581] [2023-12-16 04:18:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:19,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:19,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:19,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:18:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 04:18:19,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:19,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 04:18:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:18:19,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32437150] [2023-12-16 04:18:19,258 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328344581] [2023-12-16 04:18:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328344581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:19,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:19,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899769666] [2023-12-16 04:18:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:19,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:19,262 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:18:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:19,333 INFO L93 Difference]: Finished difference Result 394 states and 558 transitions. [2023-12-16 04:18:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2023-12-16 04:18:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:19,338 INFO L225 Difference]: With dead ends: 394 [2023-12-16 04:18:19,339 INFO L226 Difference]: Without dead ends: 242 [2023-12-16 04:18:19,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:19,347 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 82 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:19,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 684 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-16 04:18:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 156. [2023-12-16 04:18:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 124 states have internal predecessors, (162), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:18:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2023-12-16 04:18:19,376 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 124 [2023-12-16 04:18:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:19,377 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2023-12-16 04:18:19,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:18:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2023-12-16 04:18:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 04:18:19,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:19,380 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:19,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-16 04:18:19,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:19,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:19,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash 301930728, now seen corresponding path program 1 times [2023-12-16 04:18:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:19,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153768372] [2023-12-16 04:18:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:19,630 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:19,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183340177] [2023-12-16 04:18:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:19,639 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:19,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:18:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 04:18:19,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:19,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-16 04:18:19,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2023-12-16 04:18:19,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2023-12-16 04:18:19,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2023-12-16 04:18:20,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 28 [2023-12-16 04:18:20,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:20,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 29 [2023-12-16 04:18:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-16 04:18:20,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:18:20,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2023-12-16 04:18:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:18:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153768372] [2023-12-16 04:18:20,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183340177] [2023-12-16 04:18:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183340177] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:18:20,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:18:20,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-12-16 04:18:20,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139172259] [2023-12-16 04:18:20,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:18:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:18:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:20,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:18:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:18:20,290 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-16 04:18:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,759 INFO L93 Difference]: Finished difference Result 424 states and 587 transitions. [2023-12-16 04:18:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:18:20,760 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) Word has length 125 [2023-12-16 04:18:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,765 INFO L225 Difference]: With dead ends: 424 [2023-12-16 04:18:20,765 INFO L226 Difference]: Without dead ends: 269 [2023-12-16 04:18:20,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:18:20,769 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 216 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 382 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:18:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-16 04:18:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 205. [2023-12-16 04:18:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 168 states have internal predecessors, (214), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:18:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 278 transitions. [2023-12-16 04:18:20,803 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 278 transitions. Word has length 125 [2023-12-16 04:18:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,804 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 278 transitions. [2023-12-16 04:18:20,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-16 04:18:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 278 transitions. [2023-12-16 04:18:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 04:18:20,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,806 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:20,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:21,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:21,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 560096166, now seen corresponding path program 1 times [2023-12-16 04:18:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944581561] [2023-12-16 04:18:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:21,041 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025410508] [2023-12-16 04:18:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:21,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:21,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:18:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:21,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:18:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:21,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:18:21,644 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:18:21,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:18:21,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:21,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,859 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 04:18:21,861 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:18:21,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:18:21 BoogieIcfgContainer [2023-12-16 04:18:21,953 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:18:21,953 INFO L158 Benchmark]: Toolchain (without parser) took 6641.49ms. Allocated memory was 202.4MB in the beginning and 299.9MB in the end (delta: 97.5MB). Free memory was 147.8MB in the beginning and 192.4MB in the end (delta: -44.6MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB. [2023-12-16 04:18:21,954 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 202.4MB. Free memory was 150.4MB in the beginning and 150.3MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:18:21,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.23ms. Allocated memory is still 202.4MB. Free memory was 147.5MB in the beginning and 132.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:18:21,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.70ms. Allocated memory is still 202.4MB. Free memory was 132.8MB in the beginning and 128.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:21,954 INFO L158 Benchmark]: Boogie Preprocessor took 75.55ms. Allocated memory is still 202.4MB. Free memory was 128.9MB in the beginning and 124.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:21,955 INFO L158 Benchmark]: RCFGBuilder took 723.71ms. Allocated memory was 202.4MB in the beginning and 299.9MB in the end (delta: 97.5MB). Free memory was 124.4MB in the beginning and 252.2MB in the end (delta: -127.8MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2023-12-16 04:18:21,955 INFO L158 Benchmark]: TraceAbstraction took 5450.64ms. Allocated memory is still 299.9MB. Free memory was 251.7MB in the beginning and 192.4MB in the end (delta: 59.3MB). Peak memory consumption was 59.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:21,956 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.51ms. Allocated memory is still 202.4MB. Free memory was 150.4MB in the beginning and 150.3MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.23ms. Allocated memory is still 202.4MB. Free memory was 147.5MB in the beginning and 132.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.70ms. Allocated memory is still 202.4MB. Free memory was 132.8MB in the beginning and 128.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.55ms. Allocated memory is still 202.4MB. Free memory was 128.9MB in the beginning and 124.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 723.71ms. Allocated memory was 202.4MB in the beginning and 299.9MB in the end (delta: 97.5MB). Free memory was 124.4MB in the beginning and 252.2MB in the end (delta: -127.8MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5450.64ms. Allocated memory is still 299.9MB. Free memory was 251.7MB in the beginning and 192.4MB in the end (delta: 59.3MB). Peak memory consumption was 59.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 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] signed char signed_char_Array_0[3] = { 100, 4, 8 }; [L25-L27] signed char signed_char_Array_0[3] = { 100, 4, 8 }; [L25-L27] signed char signed_char_Array_0[3] = { 100, 4, 8 }; [L25-L27] signed char signed_char_Array_0[3] = { 100, 4, 8 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-25, -8}, {-16, 10} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-25, -8}, {-16, 10} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-25, -8}, {-16, 10} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-25, -8}, {-16, 10} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-25, -8}, {-16, 10} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 64, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 64, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 64, 128 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 5, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 5, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 5, 1 }; [L37] signed long int last_1_signed_long_int_Array_0_1__1_ = 10; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] EXPR signed_long_int_Array_0[1][1] [L96] last_1_signed_long_int_Array_0_1__1_ = signed_long_int_Array_0[1][1] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L73] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L76] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L79] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[0][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 11) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 11) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L92] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 12) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 12) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] RET updateVariables() [L108] CALL step() [L41] EXPR signed_char_Array_0[1] [L41] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND TRUE signed_char_Array_0[1] < unsigned_char_Array_0[0] [L42] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L42] COND TRUE last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1] [L43] EXPR unsigned_char_Array_0[0] [L43] EXPR signed_char_Array_0[0] [L43] signed_long_int_Array_0[0][1] = (unsigned_char_Array_0[0] - signed_char_Array_0[0]) [L50] EXPR signed_char_Array_0[1] [L50] signed_long_int_Array_0[1][0] = signed_char_Array_0[1] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][0] [L51] signed long int stepLocal_1 = unsigned_char_Array_0[1] / signed_long_int_Array_0[0][0]; [L52] EXPR signed_long_int_Array_0[0][1] [L52] EXPR signed_long_int_Array_0[1][0] [L52] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(((signed_long_int_Array_0[0][1] * signed_long_int_Array_0[1][0]) + signed_char_Array_0[0]) > stepLocal_1) [L57] EXPR signed_char_Array_0[1] [L57] signed_long_int_Array_0[1][1] = signed_char_Array_0[1] [L59] EXPR signed_long_int_Array_0[1][1] [L59] signed long int stepLocal_0 = signed_long_int_Array_0[1][1]; [L60] EXPR unsigned_char_Array_0[1] [L60] EXPR unsigned_char_Array_0[0] [L60] EXPR unsigned_long_int_Array_0[1] [L60] EXPR unsigned_long_int_Array_0[0] [L60] EXPR (unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, stepLocal_0=5, stepLocal_1=255, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND FALSE !(((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= stepLocal_0) [L63] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] COND TRUE BOOL_unsigned_char_Array_0[0] [L64] EXPR unsigned_long_int_Array_0[0] [L64] signed_char_Array_0[2] = unsigned_long_int_Array_0[0] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR unsigned_char_Array_0[1] [L99] EXPR unsigned_char_Array_0[0] [L99] EXPR unsigned_long_int_Array_0[1] [L99] EXPR unsigned_long_int_Array_0[0] [L99] EXPR (unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0]) [L99] EXPR signed_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1) [L99] EXPR signed_char_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] [L99] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR ((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]) [L99] EXPR signed_char_Array_0[0] [L99] EXPR ((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR ((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))) [L99] EXPR unsigned_long_int_Array_0[1] [L99] EXPR ((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR ((((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1)) && ((signed_char_Array_0[1] < unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) (unsigned_char_Array_0[0] - signed_char_Array_0[0]))) : 1) : (((signed_char_Array_0[0] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))) > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) signed_char_Array_0[0])) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR ((((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1)) && ((signed_char_Array_0[1] < unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) (unsigned_char_Array_0[0] - signed_char_Array_0[0]))) : 1) : (((signed_char_Array_0[0] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))) > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) signed_char_Array_0[0])) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1)) && ((signed_char_Array_0[1] < unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) (unsigned_char_Array_0[0] - signed_char_Array_0[0]))) : 1) : (((signed_char_Array_0[0] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))) > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) signed_char_Array_0[0])) : 1))) && ((((signed_long_int_Array_0[0][1] * signed_long_int_Array_0[1][0]) + signed_char_Array_0[0]) > (unsigned_char_Array_0[1] / signed_long_int_Array_0[0][0])) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) unsigned_char_Array_0[1])) : 1) : (signed_long_int_Array_0[1][1] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1)) && ((signed_char_Array_0[1] < unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) (unsigned_char_Array_0[0] - signed_char_Array_0[0]))) : 1) : (((signed_char_Array_0[0] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))) > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) signed_char_Array_0[0])) : 1))) && ((((signed_long_int_Array_0[0][1] * signed_long_int_Array_0[1][0]) + signed_char_Array_0[0]) > (unsigned_char_Array_0[1] / signed_long_int_Array_0[0][0])) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) unsigned_char_Array_0[1])) : 1) : (signed_long_int_Array_0[1][1] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR ((((((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1)) && ((signed_char_Array_0[1] < unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) (unsigned_char_Array_0[0] - signed_char_Array_0[0]))) : 1) : (((signed_char_Array_0[0] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))) > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) signed_char_Array_0[0])) : 1))) && ((((signed_long_int_Array_0[0][1] * signed_long_int_Array_0[1][0]) + signed_char_Array_0[0]) > (unsigned_char_Array_0[1] / signed_long_int_Array_0[0][0])) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) unsigned_char_Array_0[1])) : 1) : (signed_long_int_Array_0[1][1] == ((signed long int) signed_char_Array_0[1])))) && (signed_long_int_Array_0[1][0] == ((signed long int) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] EXPR ((((((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1)) && ((signed_char_Array_0[1] < unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) (unsigned_char_Array_0[0] - signed_char_Array_0[0]))) : 1) : (((signed_char_Array_0[0] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))) > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) signed_char_Array_0[0])) : 1))) && ((((signed_long_int_Array_0[0][1] * signed_long_int_Array_0[1][0]) + signed_char_Array_0[0]) > (unsigned_char_Array_0[1] / signed_long_int_Array_0[0][0])) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) unsigned_char_Array_0[1])) : 1) : (signed_long_int_Array_0[1][1] == ((signed long int) signed_char_Array_0[1])))) && (signed_long_int_Array_0[1][0] == ((signed long int) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99-L100] return ((((((unsigned_char_Array_0[1] - unsigned_char_Array_0[0]) << (unsigned_long_int_Array_0[1] + unsigned_long_int_Array_0[0])) <= signed_long_int_Array_0[1][1]) ? (signed_char_Array_0[2] == ((signed char) ((((unsigned_long_int_Array_0[1]) > (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0]))))) ? (unsigned_long_int_Array_0[1]) : (((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))))) : (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[2] == ((signed char) unsigned_long_int_Array_0[0])) : 1)) && ((signed_char_Array_0[1] < unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_1__1_ > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) (unsigned_char_Array_0[0] - signed_char_Array_0[0]))) : 1) : (((signed_char_Array_0[0] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))) > signed_char_Array_0[1]) ? (signed_long_int_Array_0[0][1] == ((signed long int) signed_char_Array_0[0])) : 1))) && ((((signed_long_int_Array_0[0][1] * signed_long_int_Array_0[1][0]) + signed_char_Array_0[0]) > (unsigned_char_Array_0[1] / signed_long_int_Array_0[0][0])) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) unsigned_char_Array_0[1])) : 1) : (signed_long_int_Array_0[1][1] == ((signed long int) signed_char_Array_0[1])))) && (signed_long_int_Array_0[1][0] == ((signed long int) signed_char_Array_0[1])) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_signed_long_int_Array_0_1__1_=10, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 522 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 1943 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1380 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 563 mSDtfsCounter, 693 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 757 GetRequests, 716 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=4, InterpolantAutomatonStates: 35, 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, 4 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1636 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3132/3264 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 04:18:21,973 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...