/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-s_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:24:41,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:24:41,601 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-21 02:24:41,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:24:41,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:24:41,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:24:41,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:24:41,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:24:41,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:24:41,633 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:24:41,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:24:41,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:24:41,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:24:41,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:24:41,635 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:24:41,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:24:41,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:24:41,636 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:24:41,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:24:41,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:24:41,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:24:41,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:24:41,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:24:41,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:24:41,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:24:41,638 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:24:41,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:24:41,638 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:24:41,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:24:41,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:24:41,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:24:41,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:24:41,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:24:41,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:24:41,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:24:41,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:24:41,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:24:41,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:24:41,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:24:41,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:24:41,640 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:24:41,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:24:41,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:24:41,641 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-21 02:24:41,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:24:41,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:24:41,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:24:41,840 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:24:41,840 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:24:41,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-52.i [2023-12-21 02:24:42,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:24:43,067 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:24:43,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-52.i [2023-12-21 02:24:43,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45f4d9ef/7773953a0bc34b1c805715d6855d11de/FLAG1795c03f0 [2023-12-21 02:24:43,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45f4d9ef/7773953a0bc34b1c805715d6855d11de [2023-12-21 02:24:43,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:24:43,090 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:24:43,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:24:43,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:24:43,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:24:43,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b11a79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43, skipping insertion in model container [2023-12-21 02:24:43,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,111 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:24:43,209 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-s_file-52.i[916,929] [2023-12-21 02:24:43,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:24:43,261 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:24:43,268 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-s_file-52.i[916,929] [2023-12-21 02:24:43,289 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:24:43,302 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:24:43,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43 WrapperNode [2023-12-21 02:24:43,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:24:43,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:24:43,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:24:43,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:24:43,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,349 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2023-12-21 02:24:43,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:24:43,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:24:43,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:24:43,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:24:43,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,396 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 18 writes are split as follows [0, 18]. [2023-12-21 02:24:43,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:24:43,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:24:43,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:24:43,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:24:43,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (1/1) ... [2023-12-21 02:24:43,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:24:43,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:43,441 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-21 02:24:43,456 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-21 02:24:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:24:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:24:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:24:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:24:43,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:24:43,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:24:43,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:24:43,554 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:24:43,556 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:24:44,003 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:24:44,034 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:24:44,034 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:24:44,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:24:44 BoogieIcfgContainer [2023-12-21 02:24:44,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:24:44,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:24:44,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:24:44,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:24:44,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:24:43" (1/3) ... [2023-12-21 02:24:44,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774b4bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:24:44, skipping insertion in model container [2023-12-21 02:24:44,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:43" (2/3) ... [2023-12-21 02:24:44,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774b4bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:24:44, skipping insertion in model container [2023-12-21 02:24:44,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:24:44" (3/3) ... [2023-12-21 02:24:44,043 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-52.i [2023-12-21 02:24:44,054 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:24:44,054 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:24:44,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:24:44,100 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;@65518702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:24:44,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:24:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 84 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 02:24:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 02:24:44,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:44,122 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:44,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:44,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash -250355526, now seen corresponding path program 1 times [2023-12-21 02:24:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517439427] [2023-12-21 02:24:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:24:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:24:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:24:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:24:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:24:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:24:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:24:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:24:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:24:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:24:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:24:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:24:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:24:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:24:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:24:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:24:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:24:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:24:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 02:24:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517439427] [2023-12-21 02:24:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517439427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:24:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:24:44,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:24:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139101679] [2023-12-21 02:24:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:24:44,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:24:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:24:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:24:44,528 INFO L87 Difference]: Start difference. First operand has 104 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 84 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 02:24:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:44,571 INFO L93 Difference]: Finished difference Result 205 states and 326 transitions. [2023-12-21 02:24:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:24:44,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-12-21 02:24:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:44,580 INFO L225 Difference]: With dead ends: 205 [2023-12-21 02:24:44,580 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 02:24:44,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:24:44,586 INFO L413 NwaCegarLoop]: 146 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, 146 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-21 02:24:44,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:24:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 02:24:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-21 02:24:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 02:24:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2023-12-21 02:24:44,622 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 140 [2023-12-21 02:24:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:44,622 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2023-12-21 02:24:44,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 02:24:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2023-12-21 02:24:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 02:24:44,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:44,625 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:44,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:24:44,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:44,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash 544956958, now seen corresponding path program 1 times [2023-12-21 02:24:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:44,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727168226] [2023-12-21 02:24:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:24:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:24:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:24:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:24:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:24:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:24:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:24:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:24:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:24:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:24:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:24:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:24:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:24:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:24:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:24:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:24:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:24:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:24:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 02:24:44,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727168226] [2023-12-21 02:24:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727168226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:24:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:24:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:24:44,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767550493] [2023-12-21 02:24:44,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:24:44,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:24:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:24:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:24:44,939 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 02:24:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:45,025 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2023-12-21 02:24:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:24:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-12-21 02:24:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:45,032 INFO L225 Difference]: With dead ends: 209 [2023-12-21 02:24:45,032 INFO L226 Difference]: Without dead ends: 108 [2023-12-21 02:24:45,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:24:45,033 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 10 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:24:45,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 430 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:24:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-21 02:24:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-12-21 02:24:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 02:24:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-21 02:24:45,043 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 140 [2023-12-21 02:24:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:45,043 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-21 02:24:45,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 02:24:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-21 02:24:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 02:24:45,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:45,045 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:45,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:24:45,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:45,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:45,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1394205088, now seen corresponding path program 1 times [2023-12-21 02:24:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:45,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39675553] [2023-12-21 02:24:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:24:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:24:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:24:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:24:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:24:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:24:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:24:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:24:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:24:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:24:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:24:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:24:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:24:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:24:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:24:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:24:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:24:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:24:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-21 02:24:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39675553] [2023-12-21 02:24:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39675553] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:24:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898429869] [2023-12-21 02:24:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:46,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:46,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:46,194 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-21 02:24:46,223 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-21 02:24:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:46,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 02:24:46,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:24:46,472 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 88 treesize of output 67 [2023-12-21 02:24:46,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 32 [2023-12-21 02:24:46,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2023-12-21 02:24:46,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:24:46,685 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 279 treesize of output 171 [2023-12-21 02:24:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-21 02:24:46,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:24:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 02:24:46,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898429869] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:24:46,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:24:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 11 [2023-12-21 02:24:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234050234] [2023-12-21 02:24:46,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:24:46,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:24:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:46,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:24:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:24:46,863 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 02:24:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:47,068 INFO L93 Difference]: Finished difference Result 259 states and 378 transitions. [2023-12-21 02:24:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:24:47,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-21 02:24:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:47,069 INFO L225 Difference]: With dead ends: 259 [2023-12-21 02:24:47,069 INFO L226 Difference]: Without dead ends: 156 [2023-12-21 02:24:47,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:24:47,071 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 104 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:24:47,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 477 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:24:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-21 02:24:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 111. [2023-12-21 02:24:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 02:24:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2023-12-21 02:24:47,083 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 140 [2023-12-21 02:24:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:47,084 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2023-12-21 02:24:47,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 02:24:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2023-12-21 02:24:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 02:24:47,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:47,085 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:47,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 02:24:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:47,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:47,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1787232098, now seen corresponding path program 1 times [2023-12-21 02:24:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100067354] [2023-12-21 02:24:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:24:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:24:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:24:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:24:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:24:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:24:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:24:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:24:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:24:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:24:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:24:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:24:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:24:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:24:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 02:24:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:24:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:24:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:24:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-21 02:24:47,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100067354] [2023-12-21 02:24:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100067354] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:24:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53922107] [2023-12-21 02:24:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:47,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:47,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:47,994 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-21 02:24:48,037 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-21 02:24:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:48,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 02:24:48,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:24:48,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:24:48,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2023-12-21 02:24:48,230 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 43 treesize of output 21 [2023-12-21 02:24:48,255 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 43 treesize of output 21 [2023-12-21 02:24:48,278 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 43 treesize of output 21 [2023-12-21 02:24:48,296 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 43 treesize of output 21 [2023-12-21 02:24:48,317 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 43 treesize of output 21 [2023-12-21 02:24:48,336 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 43 treesize of output 21 [2023-12-21 02:24:48,357 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 43 treesize of output 21 [2023-12-21 02:24:48,385 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 43 treesize of output 21 [2023-12-21 02:24:48,391 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 33 treesize of output 15 [2023-12-21 02:24:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-12-21 02:24:48,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:24:48,618 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 35 treesize of output 17 [2023-12-21 02:24:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-21 02:24:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53922107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 02:24:48,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 02:24:48,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-12-21 02:24:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52722646] [2023-12-21 02:24:48,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 02:24:48,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:24:48,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:24:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:24:48,633 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-21 02:24:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:49,029 INFO L93 Difference]: Finished difference Result 242 states and 349 transitions. [2023-12-21 02:24:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:24:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 140 [2023-12-21 02:24:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:49,030 INFO L225 Difference]: With dead ends: 242 [2023-12-21 02:24:49,030 INFO L226 Difference]: Without dead ends: 132 [2023-12-21 02:24:49,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 308 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:24:49,032 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 306 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:24:49,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 306 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:24:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-21 02:24:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2023-12-21 02:24:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.34) internal successors, (134), 101 states have internal predecessors, (134), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:24:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2023-12-21 02:24:49,040 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 140 [2023-12-21 02:24:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:49,041 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2023-12-21 02:24:49,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-21 02:24:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2023-12-21 02:24:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-21 02:24:49,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:49,042 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:49,048 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-21 02:24:49,248 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,SelfDestructingSolverStorable3 [2023-12-21 02:24:49,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:49,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2012907235, now seen corresponding path program 1 times [2023-12-21 02:24:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473239762] [2023-12-21 02:24:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:24:49,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:24:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:24:49,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:24:49,364 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:24:49,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:24:49,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:24:49,368 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-21 02:24:49,370 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:24:49,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:24:49 BoogieIcfgContainer [2023-12-21 02:24:49,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:24:49,409 INFO L158 Benchmark]: Toolchain (without parser) took 6319.31ms. Allocated memory was 181.4MB in the beginning and 311.4MB in the end (delta: 130.0MB). Free memory was 134.4MB in the beginning and 169.0MB in the end (delta: -34.6MB). Peak memory consumption was 96.3MB. Max. memory is 8.0GB. [2023-12-21 02:24:49,409 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 181.4MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:24:49,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.47ms. Allocated memory is still 181.4MB. Free memory was 134.1MB in the beginning and 118.0MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 02:24:49,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.76ms. Allocated memory is still 181.4MB. Free memory was 118.0MB in the beginning and 114.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:24:49,410 INFO L158 Benchmark]: Boogie Preprocessor took 66.67ms. Allocated memory is still 181.4MB. Free memory was 114.2MB in the beginning and 109.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:24:49,410 INFO L158 Benchmark]: RCFGBuilder took 617.92ms. Allocated memory is still 181.4MB. Free memory was 109.7MB in the beginning and 137.0MB in the end (delta: -27.4MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2023-12-21 02:24:49,410 INFO L158 Benchmark]: TraceAbstraction took 5372.23ms. Allocated memory was 181.4MB in the beginning and 311.4MB in the end (delta: 130.0MB). Free memory was 136.0MB in the beginning and 169.0MB in the end (delta: -33.1MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. [2023-12-21 02:24:49,411 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.42ms. Allocated memory is still 181.4MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.47ms. Allocated memory is still 181.4MB. Free memory was 134.1MB in the beginning and 118.0MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.76ms. Allocated memory is still 181.4MB. Free memory was 118.0MB in the beginning and 114.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.67ms. Allocated memory is still 181.4MB. Free memory was 114.2MB in the beginning and 109.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 617.92ms. Allocated memory is still 181.4MB. Free memory was 109.7MB in the beginning and 137.0MB in the end (delta: -27.4MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. * TraceAbstraction took 5372.23ms. Allocated memory was 181.4MB in the beginning and 311.4MB in the end (delta: 130.0MB). Free memory was 136.0MB in the beginning and 169.0MB in the end (delta: -33.1MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of bitwise operation at line 118, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L85] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L89] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_13 [L108] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_13 [L108] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_14 [L110] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_14 [L110] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 30) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 30) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L60] EXPR WrapperStruct00.var_1_3 [L60] signed short int stepLocal_0 = WrapperStruct00.var_1_3; [L61] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L61] COND FALSE !(stepLocal_0 > ((WrapperStruct00.var_1_4 / -256) * 32)) [L68] EXPR WrapperStruct00.var_1_9 [L68] WrapperStruct00.var_1_5 = WrapperStruct00.var_1_9 [L70] WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND TRUE WrapperStruct00.var_1_7 [L71] EXPR WrapperStruct00.var_1_11 [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14) [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=13] [L71] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))) [L73] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] COND TRUE WrapperStruct00.var_1_10 < 63.75 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_1 = (10 - WrapperStruct00.var_1_3) [L78] EXPR WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] COND FALSE !(! (WrapperStruct00.var_1_13 < (127.125 / WrapperStruct00.var_1_12))) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4))) [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR (WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1)) && ((! (WrapperStruct00.var_1_13 < (127.125 / WrapperStruct00.var_1_12))) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_3) + (-2 << WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_3)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1)) && ((! (WrapperStruct00.var_1_13 < (127.125 / WrapperStruct00.var_1_12))) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_3) + (-2 << WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_3)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L118-L119] return ((((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1)) && ((! (WrapperStruct00.var_1_13 < (127.125 / WrapperStruct00.var_1_12))) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_3) + (-2 << WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_3)) : 1) : 1) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 1359 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 851 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 731 IncrementalHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 508 mSDtfsCounter, 731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 720 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 982 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 6115 SizeOfPredicates, 17 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 4725/4896 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-21 02:24:49,426 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...