/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/sqrt1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 04:47:55,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 04:47:55,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 04:47:55,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 04:47:55,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 04:47:55,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 04:47:55,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 04:47:55,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 04:47:55,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 04:47:55,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 04:47:55,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 04:47:55,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 04:47:55,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 04:47:55,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 04:47:55,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 04:47:55,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 04:47:55,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 04:47:55,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 04:47:55,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 04:47:55,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 04:47:55,118 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 04:47:55,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 04:47:55,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 04:47:55,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 04:47:55,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 04:47:55,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 04:47:55,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 04:47:55,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 04:47:55,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 04:47:55,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 04:47:55,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 04:47:55,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 04:47:55,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 04:47:55,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 04:47:55,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 04:47:55,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 04:47:55,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 04:47:55,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 04:47:55,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 04:47:55,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 04:47:55,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 04:47:55,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 04:47:55,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 04:47:55,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 04:47:55,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 04:47:55,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 04:47:55,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 04:47:55,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 04:47:55,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 04:47:55,176 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 04:47:55,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 04:47:55,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 04:47:55,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 04:47:55,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 04:47:55,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 04:47:55,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:47:55,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 04:47:55,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 04:47:55,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 04:47:55,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 04:47:55,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 04:47:55,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 04:47:55,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 04:47:55,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 04:47:55,180 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 04:47:55,180 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-15 04:47:55,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 04:47:55,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 04:47:55,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 04:47:55,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 04:47:55,420 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 04:47:55,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-15 04:47:55,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2a3815b/f17e360bb6ae4986bafcaa930b74a8f0/FLAGe00de5416 [2022-04-15 04:47:55,893 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 04:47:55,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-15 04:47:55,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2a3815b/f17e360bb6ae4986bafcaa930b74a8f0/FLAGe00de5416 [2022-04-15 04:47:56,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2a3815b/f17e360bb6ae4986bafcaa930b74a8f0 [2022-04-15 04:47:56,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 04:47:56,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 04:47:56,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 04:47:56,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 04:47:56,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 04:47:56,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172cb2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56, skipping insertion in model container [2022-04-15 04:47:56,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 04:47:56,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 04:47:56,488 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/sqrt1-ll_unwindbound20.c[520,533] [2022-04-15 04:47:56,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:47:56,535 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 04:47:56,547 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/sqrt1-ll_unwindbound20.c[520,533] [2022-04-15 04:47:56,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:47:56,561 INFO L208 MainTranslator]: Completed translation [2022-04-15 04:47:56,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56 WrapperNode [2022-04-15 04:47:56,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 04:47:56,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 04:47:56,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 04:47:56,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 04:47:56,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 04:47:56,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 04:47:56,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 04:47:56,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 04:47:56,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:47:56,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:47:56,626 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-15 04:47:56,634 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-15 04:47:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 04:47:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 04:47:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 04:47:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 04:47:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 04:47:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 04:47:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 04:47:56,705 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 04:47:56,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 04:47:56,801 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 04:47:56,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 04:47:56,807 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 04:47:56,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:47:56 BoogieIcfgContainer [2022-04-15 04:47:56,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 04:47:56,809 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 04:47:56,809 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 04:47:56,809 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 04:47:56,811 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:47:56" (1/1) ... [2022-04-15 04:47:56,813 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 04:47:56,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:47:56 BasicIcfg [2022-04-15 04:47:56,827 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 04:47:56,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 04:47:56,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 04:47:56,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 04:47:56,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:47:56" (1/4) ... [2022-04-15 04:47:56,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288d4824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:47:56, skipping insertion in model container [2022-04-15 04:47:56,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:47:56" (2/4) ... [2022-04-15 04:47:56,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288d4824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:47:56, skipping insertion in model container [2022-04-15 04:47:56,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:47:56" (3/4) ... [2022-04-15 04:47:56,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288d4824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:47:56, skipping insertion in model container [2022-04-15 04:47:56,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:47:56" (4/4) ... [2022-04-15 04:47:56,833 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound20.cqvasr [2022-04-15 04:47:56,836 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 04:47:56,837 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 04:47:56,866 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 04:47:56,871 INFO L340 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 [2022-04-15 04:47:56,891 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 04:47:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:47:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 04:47:56,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:47:56,940 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:47:56,941 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:47:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:47:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1238828824, now seen corresponding path program 1 times [2022-04-15 04:47:56,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:47:56,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531009605] [2022-04-15 04:47:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:47:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 04:47:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:57,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {29#true} is VALID [2022-04-15 04:47:57,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 04:47:57,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 04:47:57,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 04:47:57,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {29#true} is VALID [2022-04-15 04:47:57,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 04:47:57,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 04:47:57,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 04:47:57,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {29#true} is VALID [2022-04-15 04:47:57,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [75] L30-3-->L30-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 04:47:57,282 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {30#false} is VALID [2022-04-15 04:47:57,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#false} is VALID [2022-04-15 04:47:57,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [84] L12-->L13: Formula: (= 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[] {30#false} is VALID [2022-04-15 04:47:57,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 04:47:57,283 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-15 04:47:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:47:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531009605] [2022-04-15 04:47:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531009605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:47:57,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:47:57,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 04:47:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034494984] [2022-04-15 04:47:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:47:57,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 04:47:57,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:47:57,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 04:47:57,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:47:57,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 04:47:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:47:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 04:47:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 04:47:57,364 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 04:47:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:57,544 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-15 04:47:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 04:47:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 04:47:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:47:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 04:47:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 04:47:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 04:47:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 04:47:57,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 04:47:57,643 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-15 04:47:57,652 INFO L225 Difference]: With dead ends: 47 [2022-04-15 04:47:57,652 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 04:47:57,655 INFO L912 BasicCegarLoop]: 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-15 04:47:57,659 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:47:57,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:47:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 04:47:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 04:47:57,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:47:57,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:57,682 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:57,683 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:57,691 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 04:47:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 04:47:57,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:57,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:57,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 04:47:57,693 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 04:47:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:57,702 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 04:47:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 04:47:57,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:57,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:57,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:47:57,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:47:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-15 04:47:57,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-15 04:47:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:47:57,706 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-15 04:47:57,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 04:47:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 04:47:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 04:47:57,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:47:57,711 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:47:57,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 04:47:57,712 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:47:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:47:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -221581531, now seen corresponding path program 1 times [2022-04-15 04:47:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:47:57,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029000758] [2022-04-15 04:47:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:47:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 04:47:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:57,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187#(= ~counter~0 0)} {182#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 04:47:57,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#(= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#(= ~counter~0 0)} {182#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {187#(= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#(= ~counter~0 0)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {187#(= ~counter~0 0)} is VALID [2022-04-15 04:47:57,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(= ~counter~0 0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {188#(= |main_#t~post5| 0)} is VALID [2022-04-15 04:47:57,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= |main_#t~post5| 0)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {183#false} is VALID [2022-04-15 04:47:57,818 INFO L272 TraceCheckUtils]: 8: Hoare triple {183#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {183#false} is VALID [2022-04-15 04:47:57,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {183#false} is VALID [2022-04-15 04:47:57,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} [84] L12-->L13: Formula: (= 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[] {183#false} is VALID [2022-04-15 04:47:57,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-15 04:47:57,819 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-15 04:47:57,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:47:57,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029000758] [2022-04-15 04:47:57,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029000758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:47:57,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:47:57,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 04:47:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728190571] [2022-04-15 04:47:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:47:57,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 04:47:57,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:47:57,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 04:47:57,831 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-15 04:47:57,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:47:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:47:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:47:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 04:47:57,834 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 04:47:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:57,959 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 04:47:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 04:47:57,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 04:47:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:47:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 04:47:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 04:47:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 04:47:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 04:47:57,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 04:47:57,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:47:57,993 INFO L225 Difference]: With dead ends: 32 [2022-04-15 04:47:57,993 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 04:47:57,993 INFO L912 BasicCegarLoop]: 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-15 04:47:57,994 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:47:57,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:47:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 04:47:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 04:47:57,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:47:57,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:57,998 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:57,999 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,000 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 04:47:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 04:47:58,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:58,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:58,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 04:47:58,001 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 04:47:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,002 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 04:47:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 04:47:58,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:58,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:58,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:47:58,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:47:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:47:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-15 04:47:58,004 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-15 04:47:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:47:58,005 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-15 04:47:58,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 04:47:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 04:47:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 04:47:58,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:47:58,005 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:47:58,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 04:47:58,006 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:47:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:47:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash -220509055, now seen corresponding path program 1 times [2022-04-15 04:47:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:47:58,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930577139] [2022-04-15 04:47:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:47:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 04:47:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:58,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {325#true} is VALID [2022-04-15 04:47:58,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 04:47:58,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 04:47:58,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 04:47:58,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {325#true} is VALID [2022-04-15 04:47:58,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 04:47:58,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 04:47:58,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 04:47:58,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 04:47:58,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 04:47:58,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 04:47:58,084 INFO L272 TraceCheckUtils]: 8: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:47:58,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(not (= |__VERIFIER_assert_#in~cond| 0))} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {332#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 04:47:58,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(not (= __VERIFIER_assert_~cond 0))} [84] L12-->L13: Formula: (= 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[] {326#false} is VALID [2022-04-15 04:47:58,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#false} is VALID [2022-04-15 04:47:58,086 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-15 04:47:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:47:58,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930577139] [2022-04-15 04:47:58,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930577139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:47:58,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:47:58,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 04:47:58,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562212610] [2022-04-15 04:47:58,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:47:58,087 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-15 04:47:58,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:47:58,087 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-15 04:47:58,096 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-15 04:47:58,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 04:47:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:47:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 04:47:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 04:47:58,097 INFO L87 Difference]: Start difference. First operand 23 states and 29 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-15 04:47:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,357 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 04:47:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 04:47:58,357 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-15 04:47:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:47:58,357 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-15 04:47:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 04:47:58,359 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-15 04:47:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 04:47:58,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 04:47:58,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:47:58,409 INFO L225 Difference]: With dead ends: 36 [2022-04-15 04:47:58,409 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 04:47:58,409 INFO L912 BasicCegarLoop]: 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-15 04:47:58,410 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:47:58,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:47:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 04:47:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 04:47:58,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:47:58,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 04:47:58,415 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 04:47:58,416 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 04:47:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,417 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 04:47:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 04:47:58,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:58,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:58,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 04:47:58,419 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 04:47:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,421 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 04:47:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 04:47:58,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:58,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:58,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:47:58,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:47:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 04:47:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 04:47:58,423 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-15 04:47:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:47:58,423 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 04:47:58,424 INFO L479 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-15 04:47:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 04:47:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 04:47:58,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:47:58,424 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:47:58,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 04:47:58,425 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:47:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:47:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1748396925, now seen corresponding path program 1 times [2022-04-15 04:47:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:47:58,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946372705] [2022-04-15 04:47:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:47:58,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:47:58,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131642306] [2022-04-15 04:47:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:58,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:47:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:47:58,436 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-15 04:47:58,437 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-15 04:47:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:58,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 04:47:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:58,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:47:58,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-15 04:47:58,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {518#true} is VALID [2022-04-15 04:47:58,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-15 04:47:58,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-15 04:47:58,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-15 04:47:58,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 04:47:58,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 04:47:58,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 04:47:58,603 INFO L272 TraceCheckUtils]: 8: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {518#true} is VALID [2022-04-15 04:47:58,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {518#true} is VALID [2022-04-15 04:47:58,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-15 04:47:58,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {518#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#true} is VALID [2022-04-15 04:47:58,604 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {518#true} {538#(and (= main_~a~0 0) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 04:47:58,605 INFO L272 TraceCheckUtils]: 13: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:47:58,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:47:58,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= 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[] {519#false} is VALID [2022-04-15 04:47:58,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {519#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {519#false} is VALID [2022-04-15 04:47:58,606 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-15 04:47:58,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 04:47:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:47:58,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946372705] [2022-04-15 04:47:58,607 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:47:58,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131642306] [2022-04-15 04:47:58,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131642306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:47:58,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:47:58,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 04:47:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537663780] [2022-04-15 04:47:58,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:47:58,608 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, (4), 2 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-15 04:47:58,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:47:58,608 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, (4), 2 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-15 04:47:58,619 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-15 04:47:58,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:47:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:47:58,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:47:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 04:47:58,620 INFO L87 Difference]: Start difference. First operand 32 states and 42 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, (4), 2 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-15 04:47:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,725 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 04:47:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 04:47:58,725 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, (4), 2 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-15 04:47:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:47:58,726 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, (4), 2 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-15 04:47:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 04:47:58,727 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, (4), 2 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-15 04:47:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 04:47:58,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 04:47:58,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:47:58,761 INFO L225 Difference]: With dead ends: 40 [2022-04-15 04:47:58,761 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 04:47:58,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-15 04:47:58,762 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:47:58,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:47:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 04:47:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 04:47:58,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:47:58,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 04:47:58,772 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 04:47:58,772 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 04:47:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,774 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 04:47:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 04:47:58,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:58,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:58,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 04:47:58,775 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 04:47:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:58,777 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 04:47:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 04:47:58,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:58,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:58,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:47:58,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:47:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 04:47:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-15 04:47:58,782 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-15 04:47:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:47:58,782 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-15 04:47:58,782 INFO L479 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, (4), 2 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-15 04:47:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-15 04:47:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 04:47:58,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:47:58,785 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:47:58,815 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-15 04:47:58,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:47:58,999 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:47:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:47:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -214718627, now seen corresponding path program 1 times [2022-04-15 04:47:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:47:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45121036] [2022-04-15 04:47:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:47:59,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:47:59,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458013385] [2022-04-15 04:47:59,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:59,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:47:59,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:47:59,023 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-15 04:47:59,024 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-15 04:47:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:59,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 04:47:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:59,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:47:59,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {769#true} is VALID [2022-04-15 04:47:59,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:47:59,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:47:59,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:47:59,211 INFO L272 TraceCheckUtils]: 8: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {769#true} is VALID [2022-04-15 04:47:59,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {769#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {769#true} is VALID [2022-04-15 04:47:59,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,212 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:47:59,212 INFO L272 TraceCheckUtils]: 13: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {769#true} is VALID [2022-04-15 04:47:59,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {769#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {769#true} is VALID [2022-04-15 04:47:59,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#true} is VALID [2022-04-15 04:47:59,213 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:47:59,213 INFO L272 TraceCheckUtils]: 18: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:47:59,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:47:59,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= 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[] {770#false} is VALID [2022-04-15 04:47:59,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {770#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {770#false} is VALID [2022-04-15 04:47:59,215 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-15 04:47:59,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 04:47:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:47:59,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45121036] [2022-04-15 04:47:59,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:47:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458013385] [2022-04-15 04:47:59,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458013385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:47:59,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:47:59,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 04:47:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246960048] [2022-04-15 04:47:59,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:47:59,220 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-15 04:47:59,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:47:59,221 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-15 04:47:59,236 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-15 04:47:59,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:47:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:47:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:47:59,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 04:47:59,239 INFO L87 Difference]: Start difference. First operand 37 states and 47 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-15 04:47:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:59,362 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 04:47:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 04:47:59,363 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-15 04:47:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:47:59,363 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-15 04:47:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 04:47:59,364 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-15 04:47:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 04:47:59,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 04:47:59,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:47:59,413 INFO L225 Difference]: With dead ends: 44 [2022-04-15 04:47:59,413 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 04:47:59,413 INFO L912 BasicCegarLoop]: 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-15 04:47:59,414 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:47:59,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:47:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 04:47:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 04:47:59,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:47:59,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:47:59,419 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:47:59,419 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:47:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:59,421 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 04:47:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 04:47:59,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:59,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:59,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-15 04:47:59,422 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-15 04:47:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:47:59,423 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 04:47:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 04:47:59,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:47:59,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:47:59,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:47:59,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:47:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:47:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-15 04:47:59,425 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-15 04:47:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:47:59,425 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-15 04:47:59,425 INFO L479 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-15 04:47:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 04:47:59,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 04:47:59,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:47:59,426 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:47:59,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 04:47:59,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:47:59,640 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:47:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:47:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1697115236, now seen corresponding path program 1 times [2022-04-15 04:47:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:47:59,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747892270] [2022-04-15 04:47:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:47:59,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:47:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783148453] [2022-04-15 04:47:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:47:59,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:47:59,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:47:59,658 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-15 04:47:59,673 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-15 04:47:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:59,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 04:47:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:47:59,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:47:59,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {1051#(<= ~counter~0 0)} is VALID [2022-04-15 04:47:59,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#(<= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#(<= ~counter~0 0)} is VALID [2022-04-15 04:47:59,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#(<= ~counter~0 0)} {1043#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#(<= ~counter~0 0)} is VALID [2022-04-15 04:47:59,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#(<= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#(<= ~counter~0 0)} is VALID [2022-04-15 04:47:59,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#(<= ~counter~0 0)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1051#(<= ~counter~0 0)} is VALID [2022-04-15 04:47:59,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {1051#(<= ~counter~0 0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,818 INFO L272 TraceCheckUtils]: 8: Hoare triple {1067#(<= ~counter~0 1)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(<= ~counter~0 1)} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,820 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,820 INFO L272 TraceCheckUtils]: 13: Hoare triple {1067#(<= ~counter~0 1)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#(<= ~counter~0 1)} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,821 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,822 INFO L272 TraceCheckUtils]: 18: Hoare triple {1067#(<= ~counter~0 1)} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#(<= ~counter~0 1)} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {1067#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,823 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#(<= ~counter~0 1)} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1067#(<= ~counter~0 1)} is VALID [2022-04-15 04:47:59,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#(<= ~counter~0 1)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1122#(<= |main_#t~post5| 1)} is VALID [2022-04-15 04:47:59,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1044#false} is VALID [2022-04-15 04:47:59,825 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1044#false} is VALID [2022-04-15 04:47:59,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1044#false} is VALID [2022-04-15 04:47:59,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} [84] L12-->L13: Formula: (= 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[] {1044#false} is VALID [2022-04-15 04:47:59,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1044#false} is VALID [2022-04-15 04:47:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:47:59,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:47:59,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1044#false} is VALID [2022-04-15 04:47:59,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} [84] L12-->L13: Formula: (= 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[] {1044#false} is VALID [2022-04-15 04:47:59,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1044#false} is VALID [2022-04-15 04:47:59,954 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1044#false} is VALID [2022-04-15 04:47:59,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#(< |main_#t~post5| 20)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1044#false} is VALID [2022-04-15 04:47:59,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {1154#(< ~counter~0 20)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1150#(< |main_#t~post5| 20)} is VALID [2022-04-15 04:47:59,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {1154#(< ~counter~0 20)} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1154#(< ~counter~0 20)} is VALID [2022-04-15 04:47:59,955 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1154#(< ~counter~0 20)} is VALID [2022-04-15 04:47:59,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1043#true} is VALID [2022-04-15 04:47:59,956 INFO L272 TraceCheckUtils]: 18: Hoare triple {1154#(< ~counter~0 20)} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1043#true} is VALID [2022-04-15 04:47:59,956 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1154#(< ~counter~0 20)} is VALID [2022-04-15 04:47:59,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1043#true} is VALID [2022-04-15 04:47:59,957 INFO L272 TraceCheckUtils]: 13: Hoare triple {1154#(< ~counter~0 20)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1043#true} is VALID [2022-04-15 04:47:59,957 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1154#(< ~counter~0 20)} is VALID [2022-04-15 04:47:59,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1043#true} is VALID [2022-04-15 04:47:59,958 INFO L272 TraceCheckUtils]: 8: Hoare triple {1154#(< ~counter~0 20)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1043#true} is VALID [2022-04-15 04:47:59,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {1154#(< ~counter~0 20)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1154#(< ~counter~0 20)} is VALID [2022-04-15 04:47:59,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1209#(< ~counter~0 19)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1154#(< ~counter~0 20)} is VALID [2022-04-15 04:47:59,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#(< ~counter~0 19)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1209#(< ~counter~0 19)} is VALID [2022-04-15 04:47:59,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {1209#(< ~counter~0 19)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1209#(< ~counter~0 19)} is VALID [2022-04-15 04:47:59,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1209#(< ~counter~0 19)} {1043#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1209#(< ~counter~0 19)} is VALID [2022-04-15 04:47:59,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#(< ~counter~0 19)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1209#(< ~counter~0 19)} is VALID [2022-04-15 04:47:59,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {1209#(< ~counter~0 19)} is VALID [2022-04-15 04:47:59,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1043#true} is VALID [2022-04-15 04:47:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:47:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:47:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747892270] [2022-04-15 04:47:59,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:47:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783148453] [2022-04-15 04:47:59,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783148453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:47:59,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:47:59,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 04:47:59,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845730963] [2022-04-15 04:47:59,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:47:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-15 04:47:59,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:47:59,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 04:47:59,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:47:59,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 04:47:59,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:47:59,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 04:47:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 04:47:59,990 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 04:48:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:00,263 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-04-15 04:48:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 04:48:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-15 04:48:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:48:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 04:48:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-15 04:48:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 04:48:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-15 04:48:00,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 94 transitions. [2022-04-15 04:48:00,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:48:00,343 INFO L225 Difference]: With dead ends: 80 [2022-04-15 04:48:00,343 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 04:48:00,343 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 04:48:00,344 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:48:00,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:48:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 04:48:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-15 04:48:00,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:48:00,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:00,362 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:00,363 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:00,365 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-15 04:48:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-15 04:48:00,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:48:00,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:48:00,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-15 04:48:00,366 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-15 04:48:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:00,368 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-15 04:48:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-15 04:48:00,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:48:00,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:48:00,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:48:00,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:48:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-15 04:48:00,371 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 30 [2022-04-15 04:48:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:48:00,371 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-15 04:48:00,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 04:48:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-15 04:48:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 04:48:00,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:48:00,372 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:48:00,391 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-15 04:48:00,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:48:00,596 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:48:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:48:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1698187712, now seen corresponding path program 1 times [2022-04-15 04:48:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:48:00,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124051801] [2022-04-15 04:48:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:48:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:48:00,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:48:00,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998917229] [2022-04-15 04:48:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:48:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:48:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:48:00,612 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-15 04:48:00,613 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-15 04:48:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:48:00,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 04:48:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:48:00,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:48:00,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {1601#true} is VALID [2022-04-15 04:48:00,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 04:48:00,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 04:48:00,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 04:48:00,770 INFO L272 TraceCheckUtils]: 8: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1601#true} is VALID [2022-04-15 04:48:00,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1601#true} is VALID [2022-04-15 04:48:00,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,771 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 04:48:00,771 INFO L272 TraceCheckUtils]: 13: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1601#true} is VALID [2022-04-15 04:48:00,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1601#true} is VALID [2022-04-15 04:48:00,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,772 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 04:48:00,772 INFO L272 TraceCheckUtils]: 18: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1601#true} is VALID [2022-04-15 04:48:00,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1601#true} is VALID [2022-04-15 04:48:00,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,773 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 04:48:00,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-15 04:48:00,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-15 04:48:00,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-15 04:48:00,775 INFO L272 TraceCheckUtils]: 26: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:48:00,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:48:00,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= 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[] {1602#false} is VALID [2022-04-15 04:48:00,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1602#false} is VALID [2022-04-15 04:48:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:48:00,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:48:00,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1602#false} is VALID [2022-04-15 04:48:00,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= 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[] {1602#false} is VALID [2022-04-15 04:48:00,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:48:00,924 INFO L272 TraceCheckUtils]: 26: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:48:00,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,926 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1601#true} is VALID [2022-04-15 04:48:00,927 INFO L272 TraceCheckUtils]: 18: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1601#true} is VALID [2022-04-15 04:48:00,953 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1601#true} is VALID [2022-04-15 04:48:00,954 INFO L272 TraceCheckUtils]: 13: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1601#true} is VALID [2022-04-15 04:48:00,957 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1601#true} is VALID [2022-04-15 04:48:00,958 INFO L272 TraceCheckUtils]: 8: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1601#true} is VALID [2022-04-15 04:48:00,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-15 04:48:00,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {1601#true} is VALID [2022-04-15 04:48:00,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1601#true} is VALID [2022-04-15 04:48:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 04:48:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:48:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124051801] [2022-04-15 04:48:00,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:48:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998917229] [2022-04-15 04:48:00,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998917229] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 04:48:00,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:48:00,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 04:48:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633919727] [2022-04-15 04:48:00,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:48:00,961 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 30 [2022-04-15 04:48:00,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:48:00,961 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-15 04:48:00,976 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-15 04:48:00,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:48:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:48:00,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:48:00,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 04:48:00,977 INFO L87 Difference]: Start difference. First operand 67 states and 85 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-15 04:48:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:01,371 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-15 04:48:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 04:48:01,371 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 30 [2022-04-15 04:48:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:48:01,372 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-15 04:48:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 04:48:01,372 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-15 04:48:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 04:48:01,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 04:48:01,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:48:01,398 INFO L225 Difference]: With dead ends: 81 [2022-04-15 04:48:01,398 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 04:48:01,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 04:48:01,399 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 04:48:01,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 04:48:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 04:48:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-15 04:48:01,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:48:01,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:01,437 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:01,437 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:01,440 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 04:48:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 04:48:01,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:48:01,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:48:01,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-15 04:48:01,440 INFO L87 Difference]: Start difference. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-15 04:48:01,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:01,442 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 04:48:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 04:48:01,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:48:01,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:48:01,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:48:01,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:48:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 04:48:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-15 04:48:01,449 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 30 [2022-04-15 04:48:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:48:01,461 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-15 04:48:01,461 INFO L479 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-15 04:48:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 04:48:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 04:48:01,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:48:01,462 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:48:01,484 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-15 04:48:01,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:48:01,675 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:48:01,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:48:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash 888200606, now seen corresponding path program 2 times [2022-04-15 04:48:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:48:01,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79635676] [2022-04-15 04:48:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:48:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:48:01,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:48:01,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996924408] [2022-04-15 04:48:01,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 04:48:01,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:48:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:48:01,705 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-15 04:48:01,706 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-15 04:48:01,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 04:48:01,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 04:48:01,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 04:48:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:48:01,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:48:01,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {2185#true} is VALID [2022-04-15 04:48:01,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:48:01,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:48:01,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:48:01,944 INFO L272 TraceCheckUtils]: 8: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-15 04:48:01,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:01,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,944 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:48:01,945 INFO L272 TraceCheckUtils]: 13: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2185#true} is VALID [2022-04-15 04:48:01,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:01,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,945 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:48:01,946 INFO L272 TraceCheckUtils]: 18: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2185#true} is VALID [2022-04-15 04:48:01,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:01,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,947 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 04:48:01,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-15 04:48:01,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-15 04:48:01,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-15 04:48:01,948 INFO L272 TraceCheckUtils]: 26: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-15 04:48:01,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:01,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:01,949 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-15 04:48:01,950 INFO L272 TraceCheckUtils]: 31: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:48:01,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:48:01,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= 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[] {2186#false} is VALID [2022-04-15 04:48:01,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#false} is VALID [2022-04-15 04:48:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 04:48:01,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:48:02,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#false} is VALID [2022-04-15 04:48:02,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= 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[] {2186#false} is VALID [2022-04-15 04:48:02,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:48:02,088 INFO L272 TraceCheckUtils]: 31: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:48:02,089 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-15 04:48:02,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:02,089 INFO L272 TraceCheckUtils]: 26: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-15 04:48:02,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-15 04:48:02,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-15 04:48:02,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-15 04:48:02,093 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-15 04:48:02,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:02,094 INFO L272 TraceCheckUtils]: 18: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {2185#true} is VALID [2022-04-15 04:48:02,095 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-15 04:48:02,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:02,095 INFO L272 TraceCheckUtils]: 13: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {2185#true} is VALID [2022-04-15 04:48:02,096 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-15 04:48:02,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2185#true} is VALID [2022-04-15 04:48:02,096 INFO L272 TraceCheckUtils]: 8: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {2185#true} is VALID [2022-04-15 04:48:02,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-15 04:48:02,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-15 04:48:02,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-15 04:48:02,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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))) 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_3, #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] {2185#true} is VALID [2022-04-15 04:48:02,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2185#true} is VALID [2022-04-15 04:48:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 04:48:02,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:48:02,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79635676] [2022-04-15 04:48:02,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:48:02,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996924408] [2022-04-15 04:48:02,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996924408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:48:02,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:48:02,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-15 04:48:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464621865] [2022-04-15 04:48:02,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:48:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-15 04:48:02,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:48:02,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 04:48:02,127 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-15 04:48:02,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 04:48:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:48:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 04:48:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 04:48:02,129 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 04:48:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:02,509 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 04:48:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 04:48:02,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-15 04:48:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:48:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 04:48:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-15 04:48:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 04:48:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-15 04:48:02,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-15 04:48:02,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:48:02,565 INFO L225 Difference]: With dead ends: 79 [2022-04-15 04:48:02,566 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 04:48:02,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-15 04:48:02,567 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 04:48:02,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 67 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 04:48:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 04:48:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 04:48:02,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:48:02,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:48:02,568 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:48:02,568 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:48:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:02,568 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 04:48:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 04:48:02,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:48:02,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:48:02,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 04:48:02,569 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 04:48:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:48:02,569 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 04:48:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 04:48:02,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:48:02,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:48:02,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:48:02,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:48:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:48:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 04:48:02,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-15 04:48:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:48:02,570 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 04:48:02,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 04:48:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 04:48:02,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:48:02,572 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 04:48:02,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 04:48:02,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:48:02,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 04:48:03,009 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 04:48:03,009 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 04:48:03,009 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 04:48:03,009 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 04:48:03,009 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-15 04:48:03,009 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 04:48:03,009 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 04:48:03,009 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,009 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 2))) (and (= (+ .cse0 (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~t~0 (+ .cse0 1)))) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,009 INFO L878 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,009 INFO L882 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,010 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,010 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1)) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,010 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 49) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 49) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-15 04:48:03,010 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-15 04:48:03,012 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-15 04:48:03,013 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 04:48:03,016 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 04:48:03,017 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 04:48:03,018 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 04:48:03,018 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 04:48:03,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:48:03 BasicIcfg [2022-04-15 04:48:03,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 04:48:03,027 INFO L158 Benchmark]: Toolchain (without parser) took 6708.14ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 158.2MB in the beginning and 180.4MB in the end (delta: -22.3MB). Peak memory consumption was 125.0MB. Max. memory is 8.0GB. [2022-04-15 04:48:03,027 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 04:48:03,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.86ms. Allocated memory is still 183.5MB. Free memory was 157.8MB in the beginning and 159.4MB in the end (delta: -1.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-15 04:48:03,027 INFO L158 Benchmark]: Boogie Preprocessor took 32.77ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 04:48:03,027 INFO L158 Benchmark]: RCFGBuilder took 212.28ms. Allocated memory is still 183.5MB. Free memory was 157.8MB in the beginning and 146.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 04:48:03,027 INFO L158 Benchmark]: IcfgTransformer took 19.03ms. Allocated memory is still 183.5MB. Free memory was 146.7MB in the beginning and 145.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 04:48:03,028 INFO L158 Benchmark]: TraceAbstraction took 6196.92ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 144.9MB in the beginning and 180.4MB in the end (delta: -35.6MB). Peak memory consumption was 112.6MB. Max. memory is 8.0GB. [2022-04-15 04:48:03,029 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.10ms. Allocated memory is still 183.5MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.86ms. Allocated memory is still 183.5MB. Free memory was 157.8MB in the beginning and 159.4MB in the end (delta: -1.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.77ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 212.28ms. Allocated memory is still 183.5MB. Free memory was 157.8MB in the beginning and 146.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.03ms. Allocated memory is still 183.5MB. Free memory was 146.7MB in the beginning and 145.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6196.92ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 144.9MB in the beginning and 180.4MB in the end (delta: -35.6MB). Peak memory consumption was 112.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 616 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 224 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 47 PreInvPairs, 76 NumberOfFragments, 203 HoareAnnotationTreeSize, 47 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 879 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 7 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 149/164 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (a * 2 + a * a + 1 == s && t == a * 2 + 1) || !(\old(counter) == 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 04:48:03,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...