/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-61.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:49:42,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:49:42,149 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:49:42,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:49:42,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:49:42,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:49:42,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:49:42,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:49:42,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:49:42,171 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:49:42,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:49:42,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:49:42,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:49:42,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:49:42,172 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:49:42,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:49:42,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:49:42,173 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:49:42,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:49:42,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:49:42,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:49:42,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:49:42,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:49:42,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:49:42,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:49:42,179 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:49:42,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:49:42,179 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:49:42,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:49:42,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:49:42,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:49:42,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:49:42,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:49:42,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:49:42,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:49:42,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:49:42,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:49:42,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:49:42,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:49:42,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:49:42,181 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:49:42,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:49:42,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:49:42,182 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:49:42,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:49:42,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:49:42,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:49:42,392 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:49:42,394 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:49:42,394 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-61.i [2023-12-19 15:49:43,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:49:43,634 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:49:43,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i [2023-12-19 15:49:43,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3735b8f/69fc34a69e4b451da414143bb52ae6aa/FLAG51de821e3 [2023-12-19 15:49:44,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3735b8f/69fc34a69e4b451da414143bb52ae6aa [2023-12-19 15:49:44,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:49:44,059 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:49:44,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:49:44,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:49:44,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:49:44,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8aaf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44, skipping insertion in model container [2023-12-19 15:49:44,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:49:44,211 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-61.i[916,929] [2023-12-19 15:49:44,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:49:44,293 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:49:44,305 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-61.i[916,929] [2023-12-19 15:49:44,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:49:44,367 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:49:44,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44 WrapperNode [2023-12-19 15:49:44,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:49:44,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:49:44,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:49:44,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:49:44,377 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:49:44" (1/1) ... [2023-12-19 15:49:44,397 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:49:44" (1/1) ... [2023-12-19 15:49:44,458 INFO L138 Inliner]: procedures = 29, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2023-12-19 15:49:44,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:49:44,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:49:44,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:49:44,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:49:44,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,509 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 20]. The 23 writes are split as follows [0, 23]. [2023-12-19 15:49:44,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:49:44,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:49:44,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:49:44,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:49:44,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (1/1) ... [2023-12-19 15:49:44,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:49:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:49:44,590 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:49:44,612 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:49:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:49:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:49:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:49:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:49:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:49:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:49:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:49:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:49:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:49:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:49:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:49:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:49:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:49:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:49:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:49:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:49:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:49:44,706 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:49:44,708 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:49:45,162 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:49:45,186 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:49:45,187 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:49:45,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:49:45 BoogieIcfgContainer [2023-12-19 15:49:45,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:49:45,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:49:45,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:49:45,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:49:45,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:49:44" (1/3) ... [2023-12-19 15:49:45,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b5df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:49:45, skipping insertion in model container [2023-12-19 15:49:45,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:44" (2/3) ... [2023-12-19 15:49:45,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b5df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:49:45, skipping insertion in model container [2023-12-19 15:49:45,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:49:45" (3/3) ... [2023-12-19 15:49:45,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-61.i [2023-12-19 15:49:45,205 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:49:45,205 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:49:45,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:49:45,239 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;@1e16f500, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:49:45,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:49:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-19 15:49:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-19 15:49:45,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:49:45,253 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:49:45,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:49:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1217593208, now seen corresponding path program 1 times [2023-12-19 15:49:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:49:45,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855207866] [2023-12-19 15:49:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:49:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:49:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:49:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:49:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:49:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:49:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:49:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:49:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:49:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:49:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:49:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:49:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:49:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:49:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:49:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:49:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:49:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:49:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:49:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:49:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:49:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:49:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:49:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:49:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:49:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-19 15:49:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-19 15:49:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:49:45,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855207866] [2023-12-19 15:49:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855207866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:49:45,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:49:45,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:49:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550500089] [2023-12-19 15:49:45,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:49:45,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:49:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:49:45,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:49:45,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:49:45,700 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-19 15:49:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:49:45,767 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2023-12-19 15:49:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:49:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-12-19 15:49:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:49:45,774 INFO L225 Difference]: With dead ends: 223 [2023-12-19 15:49:45,774 INFO L226 Difference]: Without dead ends: 111 [2023-12-19 15:49:45,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:49:45,779 INFO L413 NwaCegarLoop]: 159 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, 159 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:49:45,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:49:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-19 15:49:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-19 15:49:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-19 15:49:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-12-19 15:49:45,837 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2023-12-19 15:49:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:49:45,837 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-12-19 15:49:45,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-19 15:49:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-12-19 15:49:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-19 15:49:45,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:49:45,846 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:49:45,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:49:45,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:49:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1164152566, now seen corresponding path program 1 times [2023-12-19 15:49:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:49:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432598911] [2023-12-19 15:49:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:49:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:49:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:49:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:49:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:49:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:49:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:49:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:49:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:49:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:49:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:49:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:49:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:49:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:49:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:49:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:49:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:49:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:49:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:49:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:49:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:49:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:49:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:49:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:49:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:49:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-19 15:49:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-19 15:49:46,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:49:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432598911] [2023-12-19 15:49:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432598911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:49:46,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:49:46,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:49:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680764749] [2023-12-19 15:49:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:49:46,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:49:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:49:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:49:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:49:46,259 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-19 15:49:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:49:46,312 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2023-12-19 15:49:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:49:46,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-19 15:49:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:49:46,314 INFO L225 Difference]: With dead ends: 233 [2023-12-19 15:49:46,314 INFO L226 Difference]: Without dead ends: 123 [2023-12-19 15:49:46,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:49:46,316 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 21 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:49:46,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 468 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:49:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-19 15:49:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2023-12-19 15:49:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-19 15:49:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2023-12-19 15:49:46,324 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2023-12-19 15:49:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:49:46,326 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2023-12-19 15:49:46,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-19 15:49:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2023-12-19 15:49:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-19 15:49:46,327 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:49:46,328 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:46,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:49:46,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:49:46,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:49:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash 354805940, now seen corresponding path program 1 times [2023-12-19 15:49:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:49:46,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145811630] [2023-12-19 15:49:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:46,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:49:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:49:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:49:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:49:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:49:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:49:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:49:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:49:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:49:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:49:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:49:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:49:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:49:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:49:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:49:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:49:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:49:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:49:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:49:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:49:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:49:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:49:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:49:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:49:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:49:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-19 15:49:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-19 15:49:46,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:49:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145811630] [2023-12-19 15:49:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145811630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:49:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:49:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:49:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123993950] [2023-12-19 15:49:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:49:46,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:49:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:49:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:49:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:49:46,531 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-19 15:49:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:49:46,573 INFO L93 Difference]: Finished difference Result 229 states and 334 transitions. [2023-12-19 15:49:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:49:46,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-19 15:49:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:49:46,579 INFO L225 Difference]: With dead ends: 229 [2023-12-19 15:49:46,579 INFO L226 Difference]: Without dead ends: 117 [2023-12-19 15:49:46,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:49:46,585 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 3 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:49:46,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 466 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:49:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-19 15:49:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-12-19 15:49:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-19 15:49:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2023-12-19 15:49:46,599 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 185 [2023-12-19 15:49:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:49:46,600 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2023-12-19 15:49:46,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-19 15:49:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2023-12-19 15:49:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-19 15:49:46,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:49:46,602 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:46,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:49:46,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:49:46,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:49:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash 354865522, now seen corresponding path program 1 times [2023-12-19 15:49:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:49:46,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421208923] [2023-12-19 15:49:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:46,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:49:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:49:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:49:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:49:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:49:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:49:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:49:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:49:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:49:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:49:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:49:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:49:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:49:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:49:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:49:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:49:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:49:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:49:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:49:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:49:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:49:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:49:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:49:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:49:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:49:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-19 15:49:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-19 15:49:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:49:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421208923] [2023-12-19 15:49:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421208923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:49:48,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:49:48,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:49:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048347461] [2023-12-19 15:49:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:49:48,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:49:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:49:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:49:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:49:48,444 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-19 15:49:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:49:48,759 INFO L93 Difference]: Finished difference Result 293 states and 423 transitions. [2023-12-19 15:49:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:49:48,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) Word has length 185 [2023-12-19 15:49:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:49:48,761 INFO L225 Difference]: With dead ends: 293 [2023-12-19 15:49:48,761 INFO L226 Difference]: Without dead ends: 179 [2023-12-19 15:49:48,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:49:48,762 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 212 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:49:48,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 477 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:49:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-19 15:49:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2023-12-19 15:49:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 145 states have internal predecessors, (196), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-19 15:49:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 254 transitions. [2023-12-19 15:49:48,781 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 254 transitions. Word has length 185 [2023-12-19 15:49:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:49:48,781 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 254 transitions. [2023-12-19 15:49:48,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-19 15:49:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2023-12-19 15:49:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-19 15:49:48,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:49:48,783 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:48,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:49:48,783 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:49:48,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:49:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash -154607568, now seen corresponding path program 1 times [2023-12-19 15:49:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:49:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502851204] [2023-12-19 15:49:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:49:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:49:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:49:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:49:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:49:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:49:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:49:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:49:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:49:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:49:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:49:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:49:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:49:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:49:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:49:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:49:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:49:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:49:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:49:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:49:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:49:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:49:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:49:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:49:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:49:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-19 15:49:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-19 15:49:50,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:49:50,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502851204] [2023-12-19 15:49:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502851204] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:49:50,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:49:50,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:49:50,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890158354] [2023-12-19 15:49:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:49:50,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:49:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:49:50,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:49:50,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:49:50,498 INFO L87 Difference]: Start difference. First operand 176 states and 254 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-19 15:49:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:49:50,841 INFO L93 Difference]: Finished difference Result 511 states and 732 transitions. [2023-12-19 15:49:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:49:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-12-19 15:49:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:49:50,845 INFO L225 Difference]: With dead ends: 511 [2023-12-19 15:49:50,845 INFO L226 Difference]: Without dead ends: 336 [2023-12-19 15:49:50,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:49:50,846 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 153 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:49:50,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 728 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:49:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-12-19 15:49:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 278. [2023-12-19 15:49:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 240 states have (on average 1.375) internal successors, (330), 243 states have internal predecessors, (330), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-19 15:49:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 396 transitions. [2023-12-19 15:49:50,875 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 396 transitions. Word has length 185 [2023-12-19 15:49:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:49:50,876 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 396 transitions. [2023-12-19 15:49:50,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-19 15:49:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 396 transitions. [2023-12-19 15:49:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-19 15:49:50,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:49:50,879 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:50,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:49:50,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:49:50,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:49:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1742955470, now seen corresponding path program 1 times [2023-12-19 15:49:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:49:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252019172] [2023-12-19 15:49:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:49:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:49:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:49:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:49:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:49:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:49:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:49:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:49:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:49:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:49:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:49:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:49:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:49:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:49:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:49:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:49:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:49:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:49:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:49:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:49:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:49:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:49:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:49:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:49:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:49:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-19 15:49:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-19 15:49:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:49:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252019172] [2023-12-19 15:49:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252019172] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:49:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039854824] [2023-12-19 15:49:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:49:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:49:51,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:49:51,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 15:49:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:49:52,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-19 15:49:52,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:49:52,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-19 15:49:52,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-19 15:49:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 352 proven. 60 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2023-12-19 15:49:52,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:49:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-19 15:49:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039854824] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:49:52,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:49:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-12-19 15:49:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803914842] [2023-12-19 15:49:52,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:49:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:49:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:49:52,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:49:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:49:52,775 INFO L87 Difference]: Start difference. First operand 278 states and 396 transitions. Second operand has 11 states, 8 states have (on average 9.25) internal successors, (74), 11 states have internal predecessors, (74), 5 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 5 states have call successors, (47) [2023-12-19 15:49:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:49:53,210 INFO L93 Difference]: Finished difference Result 472 states and 663 transitions. [2023-12-19 15:49:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:49:53,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 9.25) internal successors, (74), 11 states have internal predecessors, (74), 5 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 5 states have call successors, (47) Word has length 185 [2023-12-19 15:49:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:49:53,211 INFO L225 Difference]: With dead ends: 472 [2023-12-19 15:49:53,211 INFO L226 Difference]: Without dead ends: 195 [2023-12-19 15:49:53,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 15 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:49:53,214 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 158 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:49:53,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 320 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:49:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-19 15:49:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2023-12-19 15:49:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 149 states have (on average 1.3154362416107384) internal successors, (196), 151 states have internal predecessors, (196), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-19 15:49:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 258 transitions. [2023-12-19 15:49:53,230 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 258 transitions. Word has length 185 [2023-12-19 15:49:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:49:53,231 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 258 transitions. [2023-12-19 15:49:53,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 9.25) internal successors, (74), 11 states have internal predecessors, (74), 5 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 5 states have call successors, (47) [2023-12-19 15:49:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 258 transitions. [2023-12-19 15:49:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-19 15:49:53,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:49:53,232 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:53,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 15:49:53,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-19 15:49:53,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:49:53,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:49:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 683026041, now seen corresponding path program 1 times [2023-12-19 15:49:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:49:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751975646] [2023-12-19 15:49:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:49:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:49:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:49:53,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:49:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:49:53,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:49:53,672 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:49:53,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:49:53,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:49:53,676 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:49:53,678 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:49:53,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:49:53 BoogieIcfgContainer [2023-12-19 15:49:53,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:49:53,754 INFO L158 Benchmark]: Toolchain (without parser) took 9694.88ms. Allocated memory was 210.8MB in the beginning and 468.7MB in the end (delta: 257.9MB). Free memory was 153.8MB in the beginning and 399.4MB in the end (delta: -245.6MB). Peak memory consumption was 258.9MB. Max. memory is 8.0GB. [2023-12-19 15:49:53,755 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 210.8MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:49:53,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.23ms. Allocated memory is still 210.8MB. Free memory was 153.5MB in the beginning and 135.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 15:49:53,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.12ms. Allocated memory is still 210.8MB. Free memory was 135.0MB in the beginning and 177.6MB in the end (delta: -42.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-19 15:49:53,755 INFO L158 Benchmark]: Boogie Preprocessor took 106.39ms. Allocated memory is still 210.8MB. Free memory was 177.6MB in the beginning and 171.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-19 15:49:53,755 INFO L158 Benchmark]: RCFGBuilder took 620.75ms. Allocated memory is still 210.8MB. Free memory was 171.8MB in the beginning and 136.7MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-19 15:49:53,755 INFO L158 Benchmark]: TraceAbstraction took 8565.39ms. Allocated memory was 210.8MB in the beginning and 468.7MB in the end (delta: 257.9MB). Free memory was 135.6MB in the beginning and 399.4MB in the end (delta: -263.8MB). Peak memory consumption was 240.0MB. Max. memory is 8.0GB. [2023-12-19 15:49:53,758 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.87ms. Allocated memory is still 210.8MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.23ms. Allocated memory is still 210.8MB. Free memory was 153.5MB in the beginning and 135.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 88.12ms. Allocated memory is still 210.8MB. Free memory was 135.0MB in the beginning and 177.6MB in the end (delta: -42.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 106.39ms. Allocated memory is still 210.8MB. Free memory was 177.6MB in the beginning and 171.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 620.75ms. Allocated memory is still 210.8MB. Free memory was 171.8MB in the beginning and 136.7MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8565.39ms. Allocated memory was 210.8MB in the beginning and 468.7MB in the end (delta: 257.9MB). Free memory was 135.6MB in the beginning and 399.4MB in the end (delta: -263.8MB). Peak memory consumption was 240.0MB. 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 someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 91. Possible FailurePath: [L44] unsigned char isInitial = 0; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L129] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L130] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L132] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L133] EXPR WrapperStruct00.var_1_21 [L133] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L133] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L133] EXPR WrapperStruct00.var_1_21 [L133] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L133] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L133] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L133] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L133] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L146] RET updateVariables() [L147] CALL step() [L70] WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND TRUE WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_10 [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13) [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1] [L71] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))) [L75] EXPR WrapperStruct00.var_1_6 [L75] EXPR WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] EXPR WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] unsigned char stepLocal_0 = WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4; [L76] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] COND TRUE WrapperStruct00.var_1_5 || stepLocal_0 [L77] EXPR WrapperStruct00.var_1_15 [L77] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_21 [L79] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L80] EXPR WrapperStruct00.var_1_18 [L80] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_18 [L81] WrapperStruct00.var_1_23 = 0.010000000000000009 [L82] EXPR WrapperStruct00.var_1_20 [L82] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] COND FALSE !(WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) [L85] EXPR WrapperStruct00.var_1_20 [L85] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] COND TRUE WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20 [L86] EXPR WrapperStruct00.var_1_5 [L86] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L91] EXPR WrapperStruct00.var_1_23 [L91] EXPR WrapperStruct00.var_1_20 [L91] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20) [L91] EXPR WrapperStruct00.var_1_20 [L91] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1] [L91] COND TRUE WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20))) [L92] EXPR WrapperStruct00.var_1_9 [L92] EXPR WrapperStruct00.var_1_10 [L92] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR WrapperStruct00.var_1_20 [L138] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) [L138] EXPR WrapperStruct00.var_1_20 [L138] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) [L138] EXPR WrapperStruct00.var_1_1 [L138] EXPR WrapperStruct00.var_1_6 [L138] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_23 == ((double) 0.010000000000000009)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_23 == ((double) 0.010000000000000009)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138-L139] return (((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_23 == ((double) 0.010000000000000009)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 2618 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1814 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1465 IncrementalHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 804 mSDtfsCounter, 1465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 724 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=5, InterpolantAutomatonStates: 40, 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, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1472 ConstructedInterpolants, 0 QuantifiedInterpolants, 6869 SizeOfPredicates, 8 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 9420/9600 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:49:53,860 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...