/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:43:21,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:43:21,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 15:43:21,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:43:21,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:43:21,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:43:21,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:43:21,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:43:21,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:43:21,286 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:43:21,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:43:21,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:43:21,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:43:21,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:43:21,288 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:43:21,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:43:21,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:43:21,289 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:43:21,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:43:21,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:43:21,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:43:21,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:43:21,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:43:21,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:43:21,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:43:21,291 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:43:21,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:43:21,291 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:43:21,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:43:21,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:43:21,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:43:21,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:43:21,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:43:21,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:43:21,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:43:21,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:43:21,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:43:21,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:43:21,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:43:21,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:43:21,294 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:43:21,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:43:21,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:43:21,294 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 15:43:21,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:43:21,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:43:21,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:43:21,478 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:43:21,478 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:43:21,479 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-10.i [2023-12-19 15:43:22,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:43:22,696 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:43:22,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-10.i [2023-12-19 15:43:22,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bb2922e/310fec65f06f45f596fdaa8c6e761ada/FLAGd5506d3f0 [2023-12-19 15:43:22,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bb2922e/310fec65f06f45f596fdaa8c6e761ada [2023-12-19 15:43:22,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:43:22,716 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:43:22,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:43:22,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:43:22,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:43:22,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:43:22" (1/1) ... [2023-12-19 15:43:22,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a94b80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:22, skipping insertion in model container [2023-12-19 15:43:22,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:43:22" (1/1) ... [2023-12-19 15:43:22,753 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:43:22,885 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-10.i[916,929] [2023-12-19 15:43:22,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:43:22,948 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:43:22,955 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-10.i[916,929] [2023-12-19 15:43:22,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:43:23,003 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:43:23,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23 WrapperNode [2023-12-19 15:43:23,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:43:23,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:43:23,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:43:23,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:43:23,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,049 INFO L138 Inliner]: procedures = 29, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2023-12-19 15:43:23,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:43:23,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:43:23,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:43:23,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:43:23,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,084 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 22 writes are split as follows [0, 22]. [2023-12-19 15:43:23,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:43:23,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:43:23,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:43:23,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:43:23,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (1/1) ... [2023-12-19 15:43:23,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:43:23,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:43:23,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 15:43:23,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 15:43:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:43:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:43:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:43:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:43:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:43:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:43:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:43:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:43:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:43:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:43:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:43:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:43:23,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:43:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:43:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:43:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:43:23,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:43:23,315 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:43:23,317 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:43:23,741 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:43:23,779 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:43:23,779 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:43:23,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:43:23 BoogieIcfgContainer [2023-12-19 15:43:23,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:43:23,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:43:23,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:43:23,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:43:23,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:43:22" (1/3) ... [2023-12-19 15:43:23,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3acb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:43:23, skipping insertion in model container [2023-12-19 15:43:23,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:23" (2/3) ... [2023-12-19 15:43:23,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3acb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:43:23, skipping insertion in model container [2023-12-19 15:43:23,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:43:23" (3/3) ... [2023-12-19 15:43:23,787 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-10.i [2023-12-19 15:43:23,798 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:43:23,799 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:43:23,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:43:23,839 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;@2c8b1c33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:43:23,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:43:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:43:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:43:23,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:43:23,853 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:23,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:43:23,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:43:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1426010592, now seen corresponding path program 1 times [2023-12-19 15:43:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:43:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250199545] [2023-12-19 15:43:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:43:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:43:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:43:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:43:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:43:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:43:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:43:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:43:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:43:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:43:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:43:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:43:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:43:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:43:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:43:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:43:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:43:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:43:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:43:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:43:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 15:43:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:43:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:43:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250199545] [2023-12-19 15:43:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250199545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:43:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:43:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:43:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96700928] [2023-12-19 15:43:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:43:24,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:43:24,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:43:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:43:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:43:24,251 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:43:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:43:24,309 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2023-12-19 15:43:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:43:24,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-12-19 15:43:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:43:24,318 INFO L225 Difference]: With dead ends: 205 [2023-12-19 15:43:24,318 INFO L226 Difference]: Without dead ends: 102 [2023-12-19 15:43:24,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:43:24,323 INFO L413 NwaCegarLoop]: 143 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, 143 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-19 15:43:24,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:43:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-19 15:43:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-19 15:43:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:43:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2023-12-19 15:43:24,367 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 147 [2023-12-19 15:43:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:43:24,367 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2023-12-19 15:43:24,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:43:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2023-12-19 15:43:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:43:24,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:43:24,374 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:24,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:43:24,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:43:24,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:43:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2089719354, now seen corresponding path program 1 times [2023-12-19 15:43:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:43:24,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075724307] [2023-12-19 15:43:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:43:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:43:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:43:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:43:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:43:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:43:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:43:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:43:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:43:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:43:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:43:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:43:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:43:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:43:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:43:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:43:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:43:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:43:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:43:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:43:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 15:43:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:43:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:43:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075724307] [2023-12-19 15:43:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075724307] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:43:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:43:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:43:24,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995546038] [2023-12-19 15:43:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:43:24,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:43:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:43:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:43:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:43:24,627 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:43:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:43:24,694 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2023-12-19 15:43:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:43:24,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-12-19 15:43:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:43:24,695 INFO L225 Difference]: With dead ends: 209 [2023-12-19 15:43:24,695 INFO L226 Difference]: Without dead ends: 108 [2023-12-19 15:43:24,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:43:24,696 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 10 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:43:24,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 418 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:43:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-19 15:43:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-12-19 15:43:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:43:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-12-19 15:43:24,704 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 147 [2023-12-19 15:43:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:43:24,705 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-12-19 15:43:24,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:43:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-12-19 15:43:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:43:24,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:43:24,706 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:24,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:43:24,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:43:24,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:43:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1841781444, now seen corresponding path program 1 times [2023-12-19 15:43:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:43:24,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939050510] [2023-12-19 15:43:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:43:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:43:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:43:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:43:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:43:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:43:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:43:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:43:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:43:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:43:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:43:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:43:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:43:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:43:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:43:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:43:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:43:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:43:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:43:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:43:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 15:43:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:43:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:43:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939050510] [2023-12-19 15:43:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939050510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:43:24,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:43:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:43:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459727335] [2023-12-19 15:43:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:43:24,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:43:24,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:43:24,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:43:24,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:43:24,943 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:43:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:43:25,005 INFO L93 Difference]: Finished difference Result 219 states and 314 transitions. [2023-12-19 15:43:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:43:25,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:43:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:43:25,010 INFO L225 Difference]: With dead ends: 219 [2023-12-19 15:43:25,010 INFO L226 Difference]: Without dead ends: 116 [2023-12-19 15:43:25,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:43:25,012 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:43:25,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 420 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:43:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-19 15:43:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-12-19 15:43:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:43:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-12-19 15:43:25,019 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 147 [2023-12-19 15:43:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:43:25,019 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-12-19 15:43:25,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:43:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-12-19 15:43:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:43:25,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:43:25,021 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:25,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:43:25,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:43:25,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:43:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1032434818, now seen corresponding path program 1 times [2023-12-19 15:43:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:43:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38489635] [2023-12-19 15:43:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:43:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:43:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:43:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:43:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:43:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:43:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:43:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:43:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:43:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:43:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:43:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:43:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:43:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:43:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:43:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:43:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:43:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:43:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:43:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:43:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 15:43:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:43:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:43:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38489635] [2023-12-19 15:43:25,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38489635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:43:25,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:43:25,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:43:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766283826] [2023-12-19 15:43:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:43:25,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:43:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:43:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:43:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:43:25,196 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:43:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:43:25,240 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2023-12-19 15:43:25,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:43:25,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:43:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:43:25,243 INFO L225 Difference]: With dead ends: 219 [2023-12-19 15:43:25,243 INFO L226 Difference]: Without dead ends: 114 [2023-12-19 15:43:25,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:43:25,251 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 12 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 418 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-19 15:43:25,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 418 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:43:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-19 15:43:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-12-19 15:43:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:43:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2023-12-19 15:43:25,260 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 147 [2023-12-19 15:43:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:43:25,260 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2023-12-19 15:43:25,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:43:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2023-12-19 15:43:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:43:25,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:43:25,262 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:25,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:43:25,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:43:25,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:43:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1089693120, now seen corresponding path program 1 times [2023-12-19 15:43:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:43:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582955212] [2023-12-19 15:43:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:43:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:43:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:43:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:43:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:43:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:43:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:43:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:43:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:43:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:43:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:43:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:43:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:43:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:43:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:43:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:43:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:43:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:43:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:43:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:43:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 15:43:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:43:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:43:25,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582955212] [2023-12-19 15:43:25,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582955212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:43:25,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:43:25,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:43:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896078520] [2023-12-19 15:43:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:43:25,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:43:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:43:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:43:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:43:25,427 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:43:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:43:25,469 INFO L93 Difference]: Finished difference Result 219 states and 310 transitions. [2023-12-19 15:43:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:43:25,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:43:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:43:25,472 INFO L225 Difference]: With dead ends: 219 [2023-12-19 15:43:25,472 INFO L226 Difference]: Without dead ends: 112 [2023-12-19 15:43:25,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:43:25,473 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 3 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:43:25,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:43:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-19 15:43:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-12-19 15:43:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:43:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2023-12-19 15:43:25,491 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 147 [2023-12-19 15:43:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:43:25,492 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2023-12-19 15:43:25,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:43:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2023-12-19 15:43:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:43:25,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:43:25,494 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:25,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:43:25,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:43:25,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:43:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1089752702, now seen corresponding path program 1 times [2023-12-19 15:43:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:43:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052144713] [2023-12-19 15:43:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:43:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:43:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:43:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:43:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:43:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:43:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:43:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:43:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:43:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:43:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:43:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:43:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:43:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:43:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:43:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:43:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:43:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:43:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:43:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:43:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 15:43:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:43:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:43:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:43:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052144713] [2023-12-19 15:43:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052144713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:43:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:43:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:43:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47587680] [2023-12-19 15:43:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:43:27,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:43:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:43:27,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:43:27,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:43:27,130 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:43:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:43:27,278 INFO L93 Difference]: Finished difference Result 220 states and 310 transitions. [2023-12-19 15:43:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:43:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-12-19 15:43:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:43:27,279 INFO L225 Difference]: With dead ends: 220 [2023-12-19 15:43:27,279 INFO L226 Difference]: Without dead ends: 111 [2023-12-19 15:43:27,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:43:27,280 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 55 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:43:27,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 332 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:43:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-19 15:43:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2023-12-19 15:43:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:43:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2023-12-19 15:43:27,288 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 147 [2023-12-19 15:43:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:43:27,288 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2023-12-19 15:43:27,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:43:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2023-12-19 15:43:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 15:43:27,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:43:27,290 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:27,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:43:27,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:43:27,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:43:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -57754013, now seen corresponding path program 1 times [2023-12-19 15:43:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:43:27,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757253807] [2023-12-19 15:43:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:43:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:43:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:43:27,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:43:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:43:27,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:43:27,523 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:43:27,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:43:27,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:43:27,527 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:43:27,529 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:43:27,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:43:27 BoogieIcfgContainer [2023-12-19 15:43:27,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:43:27,602 INFO L158 Benchmark]: Toolchain (without parser) took 4886.11ms. Allocated memory was 249.6MB in the beginning and 335.5MB in the end (delta: 86.0MB). Free memory was 198.1MB in the beginning and 203.7MB in the end (delta: -5.6MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. [2023-12-19 15:43:27,602 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:43:27,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.07ms. Allocated memory is still 249.6MB. Free memory was 197.9MB in the beginning and 180.3MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 15:43:27,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.96ms. Allocated memory is still 249.6MB. Free memory was 180.3MB in the beginning and 176.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:43:27,602 INFO L158 Benchmark]: Boogie Preprocessor took 58.81ms. Allocated memory is still 249.6MB. Free memory was 176.1MB in the beginning and 171.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:43:27,603 INFO L158 Benchmark]: RCFGBuilder took 670.42ms. Allocated memory is still 249.6MB. Free memory was 171.7MB in the beginning and 189.9MB in the end (delta: -18.2MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2023-12-19 15:43:27,603 INFO L158 Benchmark]: TraceAbstraction took 3820.35ms. Allocated memory was 249.6MB in the beginning and 335.5MB in the end (delta: 86.0MB). Free memory was 188.8MB in the beginning and 203.7MB in the end (delta: -14.9MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2023-12-19 15:43:27,605 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.10ms. Allocated memory is still 205.5MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.07ms. Allocated memory is still 249.6MB. Free memory was 197.9MB in the beginning and 180.3MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.96ms. Allocated memory is still 249.6MB. Free memory was 180.3MB in the beginning and 176.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.81ms. Allocated memory is still 249.6MB. Free memory was 176.1MB in the beginning and 171.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 670.42ms. Allocated memory is still 249.6MB. Free memory was 171.7MB in the beginning and 189.9MB in the end (delta: -18.2MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3820.35ms. Allocated memory was 249.6MB in the beginning and 335.5MB in the end (delta: 86.0MB). Free memory was 188.8MB in the beginning and 203.7MB in the end (delta: -14.9MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someUnaryDOUBLEoperation at line 84. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L63] double last_1_WrapperStruct00_var_1_3 = 9.15; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L126] EXPR WrapperStruct00.var_1_3 [L126] last_1_WrapperStruct00_var_1_3 = WrapperStruct00.var_1_3 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_6 [L98] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_6 [L98] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L99] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_7 [L100] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_7 [L100] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L101] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L106] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L109] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L111] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L118] WrapperStruct00.var_1_17 = __VERIFIER_nondet_long() [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L120] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L121] WrapperStruct00.var_1_21 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L123] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L137] RET updateVariables() [L138] CALL step() [L67] EXPR WrapperStruct00.var_1_2 [L67] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_8 [L68] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_8 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_21 [L70] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L71] EXPR WrapperStruct00.var_1_19 [L71] signed char stepLocal_1 = WrapperStruct00.var_1_19; [L72] EXPR WrapperStruct00.var_1_10 [L72] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L72] COND FALSE !((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= stepLocal_1) [L75] EXPR WrapperStruct00.var_1_12 [L75] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L75] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14) [L75] EXPR WrapperStruct00.var_1_12 [L75] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20, stepLocal_1=123] [L75] WrapperStruct00.var_1_9 = ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))) [L77] WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L77] COND TRUE WrapperStruct00.var_1_20 [L78] EXPR WrapperStruct00.var_1_12 [L78] EXPR WrapperStruct00.var_1_14 [L78] WrapperStruct00.var_1_15 = (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14) [L82] EXPR WrapperStruct00.var_1_15 [L82] signed long int stepLocal_0 = WrapperStruct00.var_1_15; [L83] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L83] COND TRUE stepLocal_0 < WrapperStruct00.var_1_1 [L84] WrapperStruct00.var_1_3 = -0.5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR WrapperStruct00.var_1_1 [L129] EXPR WrapperStruct00.var_1_2 [L129] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)))) [L129] EXPR WrapperStruct00.var_1_15 [L129] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))) [L129] EXPR WrapperStruct00.var_1_3 [L129] EXPR (WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129-L130] return ((((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 2149 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1340 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 809 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 15:43:27,627 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...