/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 00:36:48,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 00:36:48,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 00:36:48,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 00:36:48,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 00:36:48,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 00:36:48,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 00:36:48,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 00:36:48,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 00:36:48,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 00:36:48,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 00:36:48,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 00:36:48,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 00:36:48,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 00:36:48,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 00:36:48,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 00:36:48,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 00:36:48,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 00:36:48,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 00:36:48,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 00:36:48,366 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 00:36:48,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 00:36:48,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 00:36:48,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 00:36:48,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 00:36:48,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 00:36:48,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 00:36:48,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 00:36:48,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 00:36:48,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 00:36:48,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 00:36:48,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 00:36:48,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 00:36:48,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 00:36:48,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 00:36:48,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 00:36:48,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 00:36:48,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 00:36:48,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 00:36:48,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 00:36:48,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 00:36:48,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 00:36:48,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 00:36:48,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 00:36:48,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 00:36:48,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 00:36:48,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 00:36:48,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 00:36:48,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 00:36:48,404 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 00:36:48,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 00:36:48,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 00:36:48,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 00:36:48,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 00:36:48,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 00:36:48,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 00:36:48,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 00:36:48,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 00:36:48,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 00:36:48,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 00:36:48,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 00:36:48,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 00:36:48,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:36:48,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 00:36:48,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 00:36:48,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 00:36:48,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 00:36:48,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 00:36:48,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 00:36:48,407 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 00:36:48,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 00:36:48,408 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 00:36:48,408 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 00:36:48,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 00:36:48,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 00:36:48,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 00:36:48,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 00:36:48,620 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 00:36:48,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c [2022-04-28 00:36:48,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921f454f3/415886363f514421811fba7a3d8875d1/FLAGfaf056615 [2022-04-28 00:36:49,003 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 00:36:49,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c [2022-04-28 00:36:49,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921f454f3/415886363f514421811fba7a3d8875d1/FLAGfaf056615 [2022-04-28 00:36:49,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921f454f3/415886363f514421811fba7a3d8875d1 [2022-04-28 00:36:49,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 00:36:49,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 00:36:49,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 00:36:49,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 00:36:49,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 00:36:49,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db1b0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49, skipping insertion in model container [2022-04-28 00:36:49,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 00:36:49,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 00:36:49,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c[526,539] [2022-04-28 00:36:49,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:36:49,201 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 00:36:49,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c[526,539] [2022-04-28 00:36:49,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:36:49,236 INFO L208 MainTranslator]: Completed translation [2022-04-28 00:36:49,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49 WrapperNode [2022-04-28 00:36:49,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 00:36:49,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 00:36:49,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 00:36:49,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 00:36:49,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 00:36:49,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 00:36:49,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 00:36:49,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 00:36:49,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:36:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:36:49,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 00:36:49,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 00:36:49,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 00:36:49,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 00:36:49,337 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 00:36:49,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 00:36:49,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 00:36:49,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 00:36:49,338 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 00:36:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 00:36:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 00:36:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 00:36:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 00:36:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 00:36:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 00:36:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 00:36:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 00:36:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 00:36:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 00:36:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 00:36:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 00:36:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 00:36:49,388 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 00:36:49,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 00:36:49,562 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 00:36:49,578 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 00:36:49,578 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 00:36:49,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:36:49 BoogieIcfgContainer [2022-04-28 00:36:49,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 00:36:49,584 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 00:36:49,584 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 00:36:49,585 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 00:36:49,589 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:36:49" (1/1) ... [2022-04-28 00:36:49,591 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 00:36:49,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:36:49 BasicIcfg [2022-04-28 00:36:49,616 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 00:36:49,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 00:36:49,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 00:36:49,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 00:36:49,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:36:49" (1/4) ... [2022-04-28 00:36:49,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f95065e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:36:49, skipping insertion in model container [2022-04-28 00:36:49,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:36:49" (2/4) ... [2022-04-28 00:36:49,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f95065e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:36:49, skipping insertion in model container [2022-04-28 00:36:49,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:36:49" (3/4) ... [2022-04-28 00:36:49,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f95065e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:36:49, skipping insertion in model container [2022-04-28 00:36:49,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:36:49" (4/4) ... [2022-04-28 00:36:49,622 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound2.cqvasr [2022-04-28 00:36:49,635 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 00:36:49,635 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 00:36:49,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 00:36:49,692 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bfb366e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35615146 [2022-04-28 00:36:49,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 00:36:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 00:36:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 00:36:49,703 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:49,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:49,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 121155216, now seen corresponding path program 1 times [2022-04-28 00:36:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:49,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213283985] [2022-04-28 00:36:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:36:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:49,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-28 00:36:49,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-28 00:36:49,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-28 00:36:49,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:36:49,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-28 00:36:49,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-28 00:36:49,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-28 00:36:49,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-28 00:36:49,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {34#true} is VALID [2022-04-28 00:36:49,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [101] L34-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-28 00:36:49,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} [103] L52-2-->L44-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-28 00:36:49,911 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {35#false} is VALID [2022-04-28 00:36:49,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-28 00:36:49,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-28 00:36:49,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-28 00:36:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:36:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:49,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213283985] [2022-04-28 00:36:49,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213283985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:36:49,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:36:49,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 00:36:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316141518] [2022-04-28 00:36:49,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 00:36:49,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:49,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:49,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:49,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 00:36:49,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 00:36:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 00:36:49,958 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:50,139 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-28 00:36:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 00:36:50,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 00:36:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 00:36:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 00:36:50,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-28 00:36:50,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:50,285 INFO L225 Difference]: With dead ends: 57 [2022-04-28 00:36:50,285 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 00:36:50,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 00:36:50,290 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:50,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:36:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 00:36:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 00:36:50,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:50,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,311 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,311 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:50,314 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 00:36:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 00:36:50,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:50,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:50,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 00:36:50,316 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 00:36:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:50,319 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 00:36:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 00:36:50,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:50,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:50,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:50,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-28 00:36:50,329 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-28 00:36:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:50,330 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-28 00:36:50,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-28 00:36:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 00:36:50,331 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:50,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:50,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 00:36:50,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash 152644303, now seen corresponding path program 1 times [2022-04-28 00:36:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430777093] [2022-04-28 00:36:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:36:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:50,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {215#true} is VALID [2022-04-28 00:36:50,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-28 00:36:50,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-28 00:36:50,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:36:50,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {215#true} is VALID [2022-04-28 00:36:50,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-28 00:36:50,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-28 00:36:50,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-28 00:36:50,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {220#(= main_~q~0 0)} is VALID [2022-04-28 00:36:50,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~q~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {220#(= main_~q~0 0)} is VALID [2022-04-28 00:36:50,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~q~0 0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {220#(= main_~q~0 0)} is VALID [2022-04-28 00:36:50,432 INFO L272 TraceCheckUtils]: 8: Hoare triple {220#(= main_~q~0 0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {221#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 00:36:50,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {222#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 00:36:50,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-28 00:36:50,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-28 00:36:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:36:50,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:50,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430777093] [2022-04-28 00:36:50,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430777093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:36:50,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:36:50,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:36:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36193526] [2022-04-28 00:36:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:50,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 00:36:50,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:50,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:50,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:36:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:36:50,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:36:50,446 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:50,690 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-28 00:36:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 00:36:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 00:36:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 00:36:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 00:36:50,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 00:36:50,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:50,759 INFO L225 Difference]: With dead ends: 41 [2022-04-28 00:36:50,759 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 00:36:50,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 00:36:50,760 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:50,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:36:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 00:36:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-28 00:36:50,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:50,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,765 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,766 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:50,768 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 00:36:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 00:36:50,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:50,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:50,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 00:36:50,769 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 00:36:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:50,772 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 00:36:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 00:36:50,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:50,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:50,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:50,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-28 00:36:50,774 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-28 00:36:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:50,774 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-28 00:36:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 00:36:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 00:36:50,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:50,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:50,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 00:36:50,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:50,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash -400958603, now seen corresponding path program 1 times [2022-04-28 00:36:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:50,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38663530] [2022-04-28 00:36:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:50,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:36:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:50,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:36:50,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {421#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:50,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {422#(<= |main_#t~post5| 0)} is VALID [2022-04-28 00:36:50,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} [105] L34-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {417#false} is VALID [2022-04-28 00:36:50,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#false} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {417#false} is VALID [2022-04-28 00:36:50,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {417#false} is VALID [2022-04-28 00:36:50,853 INFO L272 TraceCheckUtils]: 10: Hoare triple {417#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {417#false} is VALID [2022-04-28 00:36:50,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {417#false} is VALID [2022-04-28 00:36:50,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-28 00:36:50,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-28 00:36:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:36:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:50,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38663530] [2022-04-28 00:36:50,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38663530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:36:50,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:36:50,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 00:36:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979780324] [2022-04-28 00:36:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 00:36:50,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:50,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:50,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:50,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:36:50,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:50,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:36:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:36:50,874 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:51,052 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-28 00:36:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 00:36:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 00:36:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 00:36:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 00:36:51,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 00:36:51,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:51,103 INFO L225 Difference]: With dead ends: 46 [2022-04-28 00:36:51,103 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 00:36:51,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:36:51,104 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:51,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:36:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 00:36:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 00:36:51,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:51,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,110 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,110 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:51,112 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 00:36:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 00:36:51,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:51,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:51,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 00:36:51,113 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 00:36:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:51,114 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 00:36:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 00:36:51,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:51,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:51,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:51,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 00:36:51,118 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-28 00:36:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:51,118 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 00:36:51,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 00:36:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 00:36:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 00:36:51,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:51,120 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:51,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 00:36:51,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash 185978583, now seen corresponding path program 1 times [2022-04-28 00:36:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:51,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095817480] [2022-04-28 00:36:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:51,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:36:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:51,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {605#true} is VALID [2022-04-28 00:36:51,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 00:36:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:51,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {605#true} is VALID [2022-04-28 00:36:51,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 00:36:51,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:36:51,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {605#true} is VALID [2022-04-28 00:36:51,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 00:36:51,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(= main_~A~0 main_~r~0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 00:36:51,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(= main_~A~0 main_~r~0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 00:36:51,176 INFO L272 TraceCheckUtils]: 8: Hoare triple {610#(= main_~A~0 main_~r~0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {605#true} is VALID [2022-04-28 00:36:51,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {605#true} is VALID [2022-04-28 00:36:51,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-28 00:36:51,177 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 00:36:51,177 INFO L272 TraceCheckUtils]: 13: Hoare triple {610#(= main_~A~0 main_~r~0)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {615#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 00:36:51,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 00:36:51,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {606#false} is VALID [2022-04-28 00:36:51,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {606#false} is VALID [2022-04-28 00:36:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:36:51,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:51,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095817480] [2022-04-28 00:36:51,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095817480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:36:51,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:36:51,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:36:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141572806] [2022-04-28 00:36:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 00:36:51,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:51,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:36:51,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:51,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:36:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:36:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:36:51,191 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:36:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:51,519 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-28 00:36:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 00:36:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 00:36:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:36:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 00:36:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:36:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 00:36:51,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 00:36:51,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:51,566 INFO L225 Difference]: With dead ends: 46 [2022-04-28 00:36:51,566 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 00:36:51,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 00:36:51,567 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:51,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:36:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 00:36:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-28 00:36:51,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:51,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,575 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,575 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:51,577 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 00:36:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 00:36:51,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:51,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:51,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 00:36:51,578 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 00:36:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:51,583 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 00:36:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 00:36:51,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:51,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:51,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:51,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 00:36:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 00:36:51,585 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-28 00:36:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:51,585 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 00:36:51,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:36:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 00:36:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 00:36:51,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:51,586 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:51,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 00:36:51,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash -820589269, now seen corresponding path program 1 times [2022-04-28 00:36:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:51,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839997663] [2022-04-28 00:36:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:51,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:36:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639311584] [2022-04-28 00:36:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:51,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:36:51,601 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) [2022-04-28 00:36:51,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 00:36:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:51,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 00:36:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:51,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:36:51,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {834#true} is VALID [2022-04-28 00:36:51,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:51,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:51,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:51,786 INFO L272 TraceCheckUtils]: 8: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {834#true} is VALID [2022-04-28 00:36:51,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {834#true} is VALID [2022-04-28 00:36:51,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,788 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:51,788 INFO L272 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {834#true} is VALID [2022-04-28 00:36:51,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {834#true} is VALID [2022-04-28 00:36:51,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-28 00:36:51,789 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:51,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:36:51,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:36:51,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {835#false} is VALID [2022-04-28 00:36:51,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#false} is VALID [2022-04-28 00:36:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 00:36:51,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:36:51,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:51,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839997663] [2022-04-28 00:36:51,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:36:51,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639311584] [2022-04-28 00:36:51,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639311584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:36:51,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:36:51,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:36:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467635833] [2022-04-28 00:36:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:51,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 00:36:51,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:51,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:36:51,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:51,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:36:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:36:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:36:51,806 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:36:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:51,992 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 00:36:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:36:51,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 00:36:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:36:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 00:36:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:36:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 00:36:51,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-28 00:36:52,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:52,060 INFO L225 Difference]: With dead ends: 65 [2022-04-28 00:36:52,061 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 00:36:52,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:36:52,063 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:52,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:36:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 00:36:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 00:36:52,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:52,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,077 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,078 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:52,080 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 00:36:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 00:36:52,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:52,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:52,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 00:36:52,081 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 00:36:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:52,084 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 00:36:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 00:36:52,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:52,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:52,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:52,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 00:36:52,089 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-28 00:36:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:52,089 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 00:36:52,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:36:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 00:36:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 00:36:52,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:52,090 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:52,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 00:36:52,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:52,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:52,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1259710898, now seen corresponding path program 1 times [2022-04-28 00:36:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:52,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124751951] [2022-04-28 00:36:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:52,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:52,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:36:52,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007098256] [2022-04-28 00:36:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:52,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:36:52,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:36:52,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 00:36:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:52,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:36:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:52,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:36:52,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-28 00:36:52,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1181#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:52,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:52,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#(<= ~counter~0 0)} {1173#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:52,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:52,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1181#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:52,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(<= ~counter~0 1)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,536 INFO L272 TraceCheckUtils]: 8: Hoare triple {1197#(<= ~counter~0 1)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= ~counter~0 1)} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,538 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,539 INFO L272 TraceCheckUtils]: 13: Hoare triple {1197#(<= ~counter~0 1)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(<= ~counter~0 1)} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,540 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,541 INFO L272 TraceCheckUtils]: 18: Hoare triple {1197#(<= ~counter~0 1)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {1197#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {1197#(<= ~counter~0 1)} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {1197#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,544 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= ~counter~0 1)} [126] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[] {1197#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:52,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {1197#(<= ~counter~0 1)} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1252#(<= |main_#t~post6| 1)} is VALID [2022-04-28 00:36:52,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(<= |main_#t~post6| 1)} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1174#false} is VALID [2022-04-28 00:36:52,553 INFO L272 TraceCheckUtils]: 26: Hoare triple {1174#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1174#false} is VALID [2022-04-28 00:36:52,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1174#false} is VALID [2022-04-28 00:36:52,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#false} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-28 00:36:52,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-28 00:36:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 00:36:52,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:36:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:52,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124751951] [2022-04-28 00:36:52,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:36:52,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007098256] [2022-04-28 00:36:52,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007098256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:36:52,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:36:52,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:36:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759028643] [2022-04-28 00:36:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 00:36:52,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:52,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:52,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:52,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:36:52,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:52,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:36:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:36:52,574 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:52,650 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-28 00:36:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:36:52,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 00:36:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 00:36:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 00:36:52,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 00:36:52,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:52,688 INFO L225 Difference]: With dead ends: 70 [2022-04-28 00:36:52,688 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 00:36:52,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:36:52,689 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:52,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:36:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 00:36:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 00:36:52,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:52,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,699 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,699 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:52,701 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 00:36:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 00:36:52,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:52,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:52,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 00:36:52,702 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 00:36:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:52,703 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 00:36:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 00:36:52,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:52,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:52,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:52,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 00:36:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-28 00:36:52,706 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-28 00:36:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:52,706 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-28 00:36:52,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-28 00:36:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 00:36:52,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:52,707 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:52,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 00:36:52,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 00:36:52,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1260813165, now seen corresponding path program 1 times [2022-04-28 00:36:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:52,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828602863] [2022-04-28 00:36:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:52,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:36:52,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418483724] [2022-04-28 00:36:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:52,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:52,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:36:52,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:36:52,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 00:36:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:52,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:36:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:52,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:36:55,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {1580#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1580#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1580#true} is VALID [2022-04-28 00:36:55,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {1580#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {1580#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,588 INFO L272 TraceCheckUtils]: 8: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1580#true} is VALID [2022-04-28 00:36:55,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1580#true} is VALID [2022-04-28 00:36:55,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,589 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,589 INFO L272 TraceCheckUtils]: 13: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1580#true} is VALID [2022-04-28 00:36:55,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1580#true} is VALID [2022-04-28 00:36:55,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,590 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,590 INFO L272 TraceCheckUtils]: 18: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1580#true} is VALID [2022-04-28 00:36:55,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1580#true} is VALID [2022-04-28 00:36:55,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#true} is VALID [2022-04-28 00:36:55,591 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [126] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [109] L44-->L45: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:36:55,593 INFO L272 TraceCheckUtils]: 26: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [113] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_8 (+ (* v_main_~q~0_10 v_main_~B~0_9) v_main_~r~0_13)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_10, main_~B~0=v_main_~B~0_9, main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:36:55,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:36:55,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {1668#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1581#false} is VALID [2022-04-28 00:36:55,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {1581#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1581#false} is VALID [2022-04-28 00:36:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 00:36:55,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:36:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:55,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828602863] [2022-04-28 00:36:55,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:36:55,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418483724] [2022-04-28 00:36:55,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418483724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:36:55,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:36:55,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:36:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80532828] [2022-04-28 00:36:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:55,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 00:36:55,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:55,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:55,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:55,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:36:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:36:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:36:55,613 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:55,759 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 00:36:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:36:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 00:36:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 00:36:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 00:36:55,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 00:36:55,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:55,799 INFO L225 Difference]: With dead ends: 76 [2022-04-28 00:36:55,799 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 00:36:55,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:36:55,800 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:55,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:36:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 00:36:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 00:36:55,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:55,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:55,824 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:55,824 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:55,827 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 00:36:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 00:36:55,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:55,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:55,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 00:36:55,828 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 00:36:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:55,830 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 00:36:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 00:36:55,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:55,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:55,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:55,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-28 00:36:55,834 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-28 00:36:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:55,834 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-28 00:36:55,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-28 00:36:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 00:36:55,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:55,836 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:55,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 00:36:56,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:56,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1811137592, now seen corresponding path program 1 times [2022-04-28 00:36:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:56,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934742319] [2022-04-28 00:36:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:56,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:36:56,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224808355] [2022-04-28 00:36:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:56,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:56,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:36:56,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:36:56,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 00:36:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:56,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:36:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:56,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:36:56,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,278 INFO L272 TraceCheckUtils]: 8: Hoare triple {2024#(<= ~counter~0 1)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {2024#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {2024#(<= ~counter~0 1)} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,281 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,282 INFO L272 TraceCheckUtils]: 13: Hoare triple {2024#(<= ~counter~0 1)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(<= ~counter~0 1)} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,283 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,284 INFO L272 TraceCheckUtils]: 18: Hoare triple {2024#(<= ~counter~0 1)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {2024#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(<= ~counter~0 1)} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {2024#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,285 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {2024#(<= ~counter~0 1)} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {2024#(<= ~counter~0 1)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2079#(<= |main_#t~post5| 1)} is VALID [2022-04-28 00:36:56,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} [105] L34-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2001#false} is VALID [2022-04-28 00:36:56,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2001#false} is VALID [2022-04-28 00:36:56,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2001#false} is VALID [2022-04-28 00:36:56,287 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2001#false} is VALID [2022-04-28 00:36:56,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2001#false} is VALID [2022-04-28 00:36:56,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#false} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2001#false} is VALID [2022-04-28 00:36:56,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#false} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#false} is VALID [2022-04-28 00:36:56,288 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2001#false} {2001#false} [137] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2001#false} is VALID [2022-04-28 00:36:56,288 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} [111] L58-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (= v_main_~B~0_11 v_main_~d~0_18) 1 0)) InVars {main_~d~0=v_main_~d~0_18, main_~B~0=v_main_~B~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0] {2001#false} is VALID [2022-04-28 00:36:56,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2001#false} is VALID [2022-04-28 00:36:56,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2001#false} is VALID [2022-04-28 00:36:56,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#false} is VALID [2022-04-28 00:36:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 00:36:56,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 00:36:56,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#false} is VALID [2022-04-28 00:36:56,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2001#false} is VALID [2022-04-28 00:36:56,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2001#false} is VALID [2022-04-28 00:36:56,436 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} [111] L58-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (= v_main_~B~0_11 v_main_~d~0_18) 1 0)) InVars {main_~d~0=v_main_~d~0_18, main_~B~0=v_main_~B~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0] {2001#false} is VALID [2022-04-28 00:36:56,436 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2000#true} {2001#false} [137] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2001#false} is VALID [2022-04-28 00:36:56,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2000#true} is VALID [2022-04-28 00:36:56,436 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2000#true} is VALID [2022-04-28 00:36:56,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2001#false} is VALID [2022-04-28 00:36:56,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2001#false} is VALID [2022-04-28 00:36:56,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} [105] L34-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2001#false} is VALID [2022-04-28 00:36:56,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {2024#(<= ~counter~0 1)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2079#(<= |main_#t~post5| 1)} is VALID [2022-04-28 00:36:56,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {2024#(<= ~counter~0 1)} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,441 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2000#true} {2024#(<= ~counter~0 1)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2000#true} is VALID [2022-04-28 00:36:56,442 INFO L272 TraceCheckUtils]: 18: Hoare triple {2024#(<= ~counter~0 1)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2000#true} is VALID [2022-04-28 00:36:56,442 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2000#true} {2024#(<= ~counter~0 1)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2000#true} is VALID [2022-04-28 00:36:56,442 INFO L272 TraceCheckUtils]: 13: Hoare triple {2024#(<= ~counter~0 1)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2000#true} is VALID [2022-04-28 00:36:56,443 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2000#true} {2024#(<= ~counter~0 1)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2000#true} is VALID [2022-04-28 00:36:56,443 INFO L272 TraceCheckUtils]: 8: Hoare triple {2024#(<= ~counter~0 1)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2000#true} is VALID [2022-04-28 00:36:56,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2024#(<= ~counter~0 1)} is VALID [2022-04-28 00:36:56,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2008#(<= ~counter~0 0)} is VALID [2022-04-28 00:36:56,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2000#true} is VALID [2022-04-28 00:36:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 00:36:56,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:56,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934742319] [2022-04-28 00:36:56,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:36:56,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224808355] [2022-04-28 00:36:56,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224808355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 00:36:56,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 00:36:56,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 00:36:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545284756] [2022-04-28 00:36:56,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 00:36:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2022-04-28 00:36:56,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:56,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 00:36:56,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:56,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:36:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:56,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:36:56,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:36:56,478 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 00:36:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:56,567 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 00:36:56,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 00:36:56,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2022-04-28 00:36:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 00:36:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 00:36:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 00:36:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 00:36:56,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-28 00:36:56,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:56,615 INFO L225 Difference]: With dead ends: 90 [2022-04-28 00:36:56,616 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 00:36:56,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:36:56,616 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:56,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:36:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 00:36:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 00:36:56,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:56,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:56,641 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:56,641 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:56,643 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 00:36:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 00:36:56,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:56,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:56,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 00:36:56,644 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 00:36:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:56,645 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 00:36:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 00:36:56,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:56,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:56,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:56,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:36:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-28 00:36:56,647 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-28 00:36:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:56,648 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-28 00:36:56,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 00:36:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 00:36:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 00:36:56,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:56,648 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:56,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 00:36:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:56,859 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash -599722260, now seen corresponding path program 1 times [2022-04-28 00:36:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:56,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179611688] [2022-04-28 00:36:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:56,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:36:56,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429420262] [2022-04-28 00:36:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:56,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:36:56,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:36:56,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 00:36:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:56,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 00:36:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:36:56,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:36:57,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {2576#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {2576#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2576#true} is VALID [2022-04-28 00:36:57,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {2576#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2576#true} {2576#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {2576#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {2576#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:57,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:57,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:57,116 INFO L272 TraceCheckUtils]: 8: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2576#true} is VALID [2022-04-28 00:36:57,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,117 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2576#true} {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:57,117 INFO L272 TraceCheckUtils]: 13: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2576#true} is VALID [2022-04-28 00:36:57,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,127 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2576#true} {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:57,128 INFO L272 TraceCheckUtils]: 18: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2576#true} is VALID [2022-04-28 00:36:57,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,130 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2576#true} {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:36:57,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 00:36:57,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 00:36:57,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 00:36:57,132 INFO L272 TraceCheckUtils]: 26: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2576#true} is VALID [2022-04-28 00:36:57,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,135 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2576#true} {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 00:36:57,135 INFO L272 TraceCheckUtils]: 31: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2576#true} is VALID [2022-04-28 00:36:57,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,136 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2576#true} {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 00:36:57,136 INFO L272 TraceCheckUtils]: 36: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:36:57,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:36:57,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {2695#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2577#false} is VALID [2022-04-28 00:36:57,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {2577#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2577#false} is VALID [2022-04-28 00:36:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 00:36:57,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 00:36:57,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {2577#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2577#false} is VALID [2022-04-28 00:36:57,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {2695#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2577#false} is VALID [2022-04-28 00:36:57,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:36:57,314 INFO L272 TraceCheckUtils]: 36: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:36:57,314 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,315 INFO L272 TraceCheckUtils]: 31: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2576#true} is VALID [2022-04-28 00:36:57,315 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,316 INFO L272 TraceCheckUtils]: 26: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2576#true} is VALID [2022-04-28 00:36:57,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,319 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,320 INFO L272 TraceCheckUtils]: 18: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2576#true} is VALID [2022-04-28 00:36:57,320 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,320 INFO L272 TraceCheckUtils]: 13: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2576#true} is VALID [2022-04-28 00:36:57,321 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {2576#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {2576#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {2576#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2576#true} is VALID [2022-04-28 00:36:57,321 INFO L272 TraceCheckUtils]: 8: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2576#true} is VALID [2022-04-28 00:36:57,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2576#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 00:36:57,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2576#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2576#true} {2576#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2576#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2576#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2576#true} is VALID [2022-04-28 00:36:57,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {2576#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#true} is VALID [2022-04-28 00:36:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 00:36:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:36:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179611688] [2022-04-28 00:36:57,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:36:57,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429420262] [2022-04-28 00:36:57,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429420262] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 00:36:57,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 00:36:57,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 00:36:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661590627] [2022-04-28 00:36:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:36:57,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 00:36:57,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:36:57,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:57,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:57,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:36:57,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:36:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:36:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 00:36:57,342 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:59,504 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-28 00:36:59,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:36:59,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 00:36:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:36:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 00:36:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 00:36:59,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 00:36:59,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:36:59,564 INFO L225 Difference]: With dead ends: 78 [2022-04-28 00:36:59,564 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 00:36:59,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 00:36:59,565 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:36:59,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:36:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 00:36:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-28 00:36:59,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:36:59,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 00:36:59,580 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 00:36:59,580 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 00:36:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:59,582 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 00:36:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 00:36:59,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:59,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:59,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 00:36:59,583 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 00:36:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:36:59,584 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 00:36:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 00:36:59,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:36:59,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:36:59,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:36:59,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:36:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 00:36:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-28 00:36:59,586 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-28 00:36:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:36:59,586 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-28 00:36:59,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:36:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-28 00:36:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 00:36:59,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:36:59,587 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:36:59,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 00:36:59,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:59,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:36:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:36:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash 560903707, now seen corresponding path program 1 times [2022-04-28 00:36:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:36:59,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429962408] [2022-04-28 00:36:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:36:59,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:36:59,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992992740] [2022-04-28 00:36:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:36:59,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:36:59,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:36:59,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:36:59,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 00:36:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:36:59,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 00:36:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:36:59,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 00:36:59,911 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 00:36:59,912 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 00:36:59,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 00:37:00,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:37:00,147 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:37:00,149 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 00:37:00,173 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 00:37:00,173 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 00:37:00,173 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 00:37:00,173 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:37:00,174 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 00:37:00,175 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 00:37:00,175 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 00:37:00,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:37:00 BasicIcfg [2022-04-28 00:37:00,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 00:37:00,176 INFO L158 Benchmark]: Toolchain (without parser) took 11157.49ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 117.8MB in the beginning and 172.0MB in the end (delta: -54.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 00:37:00,177 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 00:37:00,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.90ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 144.5MB in the end (delta: -26.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 00:37:00,177 INFO L158 Benchmark]: Boogie Preprocessor took 40.01ms. Allocated memory is still 167.8MB. Free memory was 144.5MB in the beginning and 142.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 00:37:00,177 INFO L158 Benchmark]: RCFGBuilder took 303.44ms. Allocated memory is still 167.8MB. Free memory was 142.9MB in the beginning and 130.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 00:37:00,177 INFO L158 Benchmark]: IcfgTransformer took 32.74ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 129.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 00:37:00,177 INFO L158 Benchmark]: TraceAbstraction took 10558.20ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 128.7MB in the beginning and 172.0MB in the end (delta: -43.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 00:37:00,178 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.90ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 144.5MB in the end (delta: -26.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.01ms. Allocated memory is still 167.8MB. Free memory was 144.5MB in the beginning and 142.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 303.44ms. Allocated memory is still 167.8MB. Free memory was 142.9MB in the beginning and 130.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 32.74ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 129.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 10558.20ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 128.7MB in the beginning and 172.0MB in the end (delta: -43.3MB). There was no memory consumed. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [\old(counter)=0, A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=1, counter++=0, d=1, p=1, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=2, counter++=1, d=2, p=2, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L38] COND TRUE !(r >= d) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L44] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=3, counter++=2, d=2, p=2, q=0, r=1] [L44] COND FALSE !(counter++<2) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L58] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L59] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 809 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 316 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 7 NumberOfNonLiveVariables, 565 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 215/224 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 proved your program to be incorrect! [2022-04-28 00:37:00,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...