/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-81.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:54:00,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:54:00,756 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:54:00,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:54:00,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:54:00,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:54:00,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:54:00,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:54:00,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:54:00,786 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:54:00,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:54:00,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:54:00,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:54:00,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:54:00,788 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:54:00,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:54:00,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:54:00,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:54:00,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:54:00,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:54:00,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:54:00,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:54:00,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:54:00,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:54:00,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:54:00,790 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:54:00,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:54:00,790 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:54:00,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:54:00,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:54:00,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:54:00,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:54:00,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:54:00,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:54:00,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:54:00,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:54:00,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:54:00,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:54:00,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:54:00,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:54:00,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:54:00,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:54:00,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:54:00,793 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:54:00,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:54:01,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:54:01,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:54:01,019 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:54:01,020 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:54:01,020 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-81.i [2023-12-19 15:54:02,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:54:02,288 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:54:02,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i [2023-12-19 15:54:02,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b4c562c/27344e32debc4c949974f4322edbd601/FLAG5cbf0b630 [2023-12-19 15:54:02,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b4c562c/27344e32debc4c949974f4322edbd601 [2023-12-19 15:54:02,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:54:02,310 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:54:02,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:54:02,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:54:02,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:54:02,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e2a70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02, skipping insertion in model container [2023-12-19 15:54:02,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,344 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:54:02,469 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-81.i[916,929] [2023-12-19 15:54:02,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:54:02,520 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:54:02,529 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-81.i[916,929] [2023-12-19 15:54:02,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:54:02,567 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:54:02,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02 WrapperNode [2023-12-19 15:54:02,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:54:02,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:54:02,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:54:02,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:54:02,573 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:54:02" (1/1) ... [2023-12-19 15:54:02,584 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:54:02" (1/1) ... [2023-12-19 15:54:02,623 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2023-12-19 15:54:02,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:54:02,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:54:02,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:54:02,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:54:02,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,650 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 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2023-12-19 15:54:02,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:54:02,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:54:02,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:54:02,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:54:02,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (1/1) ... [2023-12-19 15:54:02,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:54:02,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:54:02,737 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:54:02,756 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:54:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:54:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:54:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:54:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:54:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:54:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:54:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:54:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:54:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:54:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:54:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:54:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:54:02,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:54:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:54:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:54:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:54:02,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:54:02,871 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:54:02,872 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:54:03,292 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:54:03,319 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:54:03,320 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:54:03,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:54:03 BoogieIcfgContainer [2023-12-19 15:54:03,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:54:03,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:54:03,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:54:03,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:54:03,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:54:02" (1/3) ... [2023-12-19 15:54:03,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aabe549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:54:03, skipping insertion in model container [2023-12-19 15:54:03,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:02" (2/3) ... [2023-12-19 15:54:03,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aabe549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:54:03, skipping insertion in model container [2023-12-19 15:54:03,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:54:03" (3/3) ... [2023-12-19 15:54:03,326 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-81.i [2023-12-19 15:54:03,341 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:54:03,341 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:54:03,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:54:03,394 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;@27617f37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:54:03,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:54:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 100 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:54:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 15:54:03,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:03,411 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:03,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:03,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:03,415 INFO L85 PathProgramCache]: Analyzing trace with hash 153063243, now seen corresponding path program 1 times [2023-12-19 15:54:03,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:03,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128832078] [2023-12-19 15:54:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:54:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:54:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:54:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:54:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:54:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:54:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:54:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128832078] [2023-12-19 15:54:03,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128832078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:03,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:03,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:54:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54842332] [2023-12-19 15:54:03,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:03,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:54:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:03,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:54:03,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:54:03,814 INFO L87 Difference]: Start difference. First operand has 120 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 100 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:54:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:03,844 INFO L93 Difference]: Finished difference Result 237 states and 382 transitions. [2023-12-19 15:54:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:54:03,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2023-12-19 15:54:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:03,851 INFO L225 Difference]: With dead ends: 237 [2023-12-19 15:54:03,851 INFO L226 Difference]: Without dead ends: 118 [2023-12-19 15:54:03,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:54:03,856 INFO L413 NwaCegarLoop]: 172 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, 172 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:54:03,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-19 15:54:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-19 15:54:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:54:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2023-12-19 15:54:03,886 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 143 [2023-12-19 15:54:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:03,886 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2023-12-19 15:54:03,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:54:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2023-12-19 15:54:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 15:54:03,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:03,890 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:03,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:54:03,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:03,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash -726475417, now seen corresponding path program 1 times [2023-12-19 15:54:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824685681] [2023-12-19 15:54:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:54:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:54:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:54:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:54:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:54:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:54:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:54:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824685681] [2023-12-19 15:54:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824685681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:04,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:04,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223211029] [2023-12-19 15:54:04,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:04,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:04,118 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:54:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:04,185 INFO L93 Difference]: Finished difference Result 241 states and 360 transitions. [2023-12-19 15:54:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:54:04,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2023-12-19 15:54:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:04,225 INFO L225 Difference]: With dead ends: 241 [2023-12-19 15:54:04,225 INFO L226 Difference]: Without dead ends: 124 [2023-12-19 15:54:04,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:04,227 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 10 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 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:54:04,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-19 15:54:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-12-19 15:54:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:54:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2023-12-19 15:54:04,268 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 143 [2023-12-19 15:54:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:04,268 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2023-12-19 15:54:04,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:54:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2023-12-19 15:54:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 15:54:04,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:04,270 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:04,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:54:04,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:04,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash 221576549, now seen corresponding path program 1 times [2023-12-19 15:54:04,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:04,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738557331] [2023-12-19 15:54:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:54:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:54:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:54:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:54:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:54:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:54:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:54:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738557331] [2023-12-19 15:54:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738557331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:04,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:04,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:04,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785495657] [2023-12-19 15:54:04,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:04,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:04,533 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:04,782 INFO L93 Difference]: Finished difference Result 359 states and 533 transitions. [2023-12-19 15:54:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:54:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-19 15:54:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:04,787 INFO L225 Difference]: With dead ends: 359 [2023-12-19 15:54:04,788 INFO L226 Difference]: Without dead ends: 240 [2023-12-19 15:54:04,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:04,792 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 166 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:04,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 372 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:54:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-19 15:54:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 213. [2023-12-19 15:54:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.396551724137931) internal successors, (243), 174 states have internal predecessors, (243), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:54:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 315 transitions. [2023-12-19 15:54:04,807 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 315 transitions. Word has length 143 [2023-12-19 15:54:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:04,807 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 315 transitions. [2023-12-19 15:54:04,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 315 transitions. [2023-12-19 15:54:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 15:54:04,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:04,809 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:04,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:54:04,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:04,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -763882544, now seen corresponding path program 1 times [2023-12-19 15:54:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:04,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108162371] [2023-12-19 15:54:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:54:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:54:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:54:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:54:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:54:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:54:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:54:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:04,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108162371] [2023-12-19 15:54:04,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108162371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:04,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:04,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:04,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876456478] [2023-12-19 15:54:04,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:04,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:04,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:04,974 INFO L87 Difference]: Start difference. First operand 213 states and 315 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:04,999 INFO L93 Difference]: Finished difference Result 364 states and 540 transitions. [2023-12-19 15:54:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:54:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-12-19 15:54:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:05,001 INFO L225 Difference]: With dead ends: 364 [2023-12-19 15:54:05,001 INFO L226 Difference]: Without dead ends: 245 [2023-12-19 15:54:05,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:54:05,002 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 68 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:05,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 533 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-19 15:54:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2023-12-19 15:54:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 178 states have internal predecessors, (247), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:54:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 319 transitions. [2023-12-19 15:54:05,013 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 319 transitions. Word has length 144 [2023-12-19 15:54:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:05,013 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 319 transitions. [2023-12-19 15:54:05,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2023-12-19 15:54:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:54:05,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:05,014 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:05,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:54:05,015 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:05,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:05,015 INFO L85 PathProgramCache]: Analyzing trace with hash 164407381, now seen corresponding path program 1 times [2023-12-19 15:54:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:05,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123941823] [2023-12-19 15:54:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:05,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:54:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:54:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:54:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:54:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:54:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:54:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:54:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:05,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123941823] [2023-12-19 15:54:05,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123941823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69707423] [2023-12-19 15:54:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:05,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:05,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:05,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:05,200 INFO L87 Difference]: Start difference. First operand 217 states and 319 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:05,391 INFO L93 Difference]: Finished difference Result 394 states and 578 transitions. [2023-12-19 15:54:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:54:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-12-19 15:54:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:05,393 INFO L225 Difference]: With dead ends: 394 [2023-12-19 15:54:05,393 INFO L226 Difference]: Without dead ends: 244 [2023-12-19 15:54:05,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:05,394 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 158 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:05,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 386 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:54:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-19 15:54:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 217. [2023-12-19 15:54:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 178 states have (on average 1.3764044943820224) internal successors, (245), 178 states have internal predecessors, (245), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:54:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 317 transitions. [2023-12-19 15:54:05,404 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 317 transitions. Word has length 146 [2023-12-19 15:54:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:05,405 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 317 transitions. [2023-12-19 15:54:05,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 317 transitions. [2023-12-19 15:54:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:54:05,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:05,406 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:05,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:54:05,406 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:05,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1422547247, now seen corresponding path program 1 times [2023-12-19 15:54:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789218420] [2023-12-19 15:54:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 15:54:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:54:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:54:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:54:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:54:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:54:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:54:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789218420] [2023-12-19 15:54:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789218420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:54:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227357557] [2023-12-19 15:54:05,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:05,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:54:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:05,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:54:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:05,643 INFO L87 Difference]: Start difference. First operand 217 states and 317 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:05,813 INFO L93 Difference]: Finished difference Result 414 states and 602 transitions. [2023-12-19 15:54:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:54:05,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-12-19 15:54:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:05,815 INFO L225 Difference]: With dead ends: 414 [2023-12-19 15:54:05,815 INFO L226 Difference]: Without dead ends: 286 [2023-12-19 15:54:05,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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:54:05,816 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 125 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:05,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 570 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:54:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-19 15:54:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2023-12-19 15:54:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:54:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 321 transitions. [2023-12-19 15:54:05,826 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 321 transitions. Word has length 147 [2023-12-19 15:54:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:05,827 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 321 transitions. [2023-12-19 15:54:05,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:54:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 321 transitions. [2023-12-19 15:54:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 15:54:05,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:05,828 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:05,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:54:05,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:05,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash -345189096, now seen corresponding path program 1 times [2023-12-19 15:54:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:05,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193530916] [2023-12-19 15:54:05,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:05,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:54:05,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:54:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:54:05,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:54:05,996 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:54:05,997 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:54:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:54:06,000 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:06,002 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:54:06,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:54:06 BoogieIcfgContainer [2023-12-19 15:54:06,047 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:54:06,047 INFO L158 Benchmark]: Toolchain (without parser) took 3737.58ms. Allocated memory was 231.7MB in the beginning and 382.7MB in the end (delta: 151.0MB). Free memory was 162.0MB in the beginning and 243.0MB in the end (delta: -81.0MB). Peak memory consumption was 71.0MB. Max. memory is 8.0GB. [2023-12-19 15:54:06,048 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 231.7MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:54:06,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.72ms. Allocated memory is still 231.7MB. Free memory was 162.0MB in the beginning and 144.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 15:54:06,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.58ms. Allocated memory is still 231.7MB. Free memory was 144.7MB in the beginning and 139.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:54:06,048 INFO L158 Benchmark]: Boogie Preprocessor took 58.53ms. Allocated memory is still 231.7MB. Free memory was 139.5MB in the beginning and 134.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:54:06,048 INFO L158 Benchmark]: RCFGBuilder took 637.61ms. Allocated memory is still 231.7MB. Free memory was 134.3MB in the beginning and 98.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-19 15:54:06,049 INFO L158 Benchmark]: TraceAbstraction took 2725.28ms. Allocated memory was 231.7MB in the beginning and 382.7MB in the end (delta: 151.0MB). Free memory was 98.0MB in the beginning and 243.0MB in the end (delta: -144.9MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2023-12-19 15:54:06,050 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 231.7MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.72ms. Allocated memory is still 231.7MB. Free memory was 162.0MB in the beginning and 144.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.58ms. Allocated memory is still 231.7MB. Free memory was 144.7MB in the beginning and 139.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.53ms. Allocated memory is still 231.7MB. Free memory was 139.5MB in the beginning and 134.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 637.61ms. Allocated memory is still 231.7MB. Free memory was 134.3MB in the beginning and 98.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2725.28ms. Allocated memory was 231.7MB in the beginning and 382.7MB in the end (delta: 151.0MB). Free memory was 98.0MB in the beginning and 243.0MB in the end (delta: -144.9MB). Peak memory consumption was 7.1MB. 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 126, overapproximation of bitwiseOr at line 63, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_13 = 5; [L58] signed long int last_1_WrapperStruct00_var_1_18 = -8; [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L122] EXPR WrapperStruct00.var_1_13 [L122] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L123] EXPR WrapperStruct00.var_1_18 [L123] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L91] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L94] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_3 [L95] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_3 [L95] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_4 [L97] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_4 [L97] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_5 [L99] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_5 [L99] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] EXPR (WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] EXPR (WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L100] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_6 [L101] 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_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_6 [L101] 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_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L111] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L117] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L134] RET updateVariables() [L135] CALL step() [L62] signed long int stepLocal_0 = (((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18)); VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L63] EXPR last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L63] COND TRUE stepLocal_0 != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13) [L64] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L64] COND TRUE WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_11 [L65] EXPR WrapperStruct00.var_1_12 [L65] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) [L70] EXPR WrapperStruct00.var_1_11 [L70] EXPR WrapperStruct00.var_1_7 [L70] unsigned char stepLocal_1 = WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7; [L71] stepLocal_1 && WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1] [L71] stepLocal_1 && WrapperStruct00.var_1_14 [L71] EXPR WrapperStruct00.var_1_14 [L71] stepLocal_1 && WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1] [L71] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_14) [L74] EXPR WrapperStruct00.var_1_16 [L74] EXPR WrapperStruct00.var_1_17 [L74] WrapperStruct00.var_1_13 = ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17) [L76] EXPR WrapperStruct00.var_1_7 [L76] signed char stepLocal_2 = WrapperStruct00.var_1_7; [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L77] COND FALSE !(stepLocal_2 > WrapperStruct00.var_1_16) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_15 [L86] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L86] COND TRUE WrapperStruct00.var_1_2 [L87] EXPR WrapperStruct00.var_1_3 [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_5 [L87] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L87] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_5 [L87] EXPR WrapperStruct00.var_1_6 [L87] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25, stepLocal_1=1, stepLocal_2=-125] [L87] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1 [L126] EXPR WrapperStruct00.var_1_1 [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR WrapperStruct00.var_1_4 [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_16) ? ((WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_18 == ((signed long int) ((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_16) ? ((WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_18 == ((signed long int) ((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126-L127] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_16) ? ((WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_18 == ((signed long int) ((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_15))) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 527 mSDsluCounter, 2538 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1582 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 956 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 151 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1015 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 1213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 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:54:06,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...