/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/prod4br-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:11:31,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:11:31,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:11:31,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:11:31,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:11:31,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:11:31,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:11:31,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:11:31,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:11:31,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:11:31,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:11:31,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:11:31,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:11:31,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:11:31,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:11:31,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:11:31,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:11:31,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:11:31,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:11:31,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:11:31,707 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:11:31,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:11:31,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:11:31,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:11:31,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:11:31,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:11:31,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:11:31,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:11:31,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:11:31,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:11:31,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:11:31,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:11:31,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:11:31,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:11:31,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:11:31,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:11:31,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:11:31,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:11:31,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:11:31,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:11:31,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:11:31,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:11:31,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:11:31,749 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:11:31,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:11:31,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:11:31,750 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:11:31,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:11:31,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:11:31,751 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:11:31,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:11:31,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:11:31,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:11:31,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:11:31,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:11:31,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:11:31,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:11:31,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:11:31,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:11:31,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:11:31,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:11:31,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:11:31,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:11:31,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:11:31,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:11:31,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:11:31,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:11:31,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:11:31,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:11:31,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:11:31,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:11:31,755 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:11:31,755 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-08 02:11:31,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:11:32,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:11:32,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:11:32,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:11:32,005 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:11:32,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-08 02:11:32,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b0b55f2/be9c31c0e43946bc98b43603484566ae/FLAG2f8e1fd50 [2022-04-08 02:11:32,399 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:11:32,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-08 02:11:32,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b0b55f2/be9c31c0e43946bc98b43603484566ae/FLAG2f8e1fd50 [2022-04-08 02:11:32,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b0b55f2/be9c31c0e43946bc98b43603484566ae [2022-04-08 02:11:32,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:11:32,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:11:32,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:11:32,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:11:32,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:11:32,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:11:32" (1/1) ... [2022-04-08 02:11:32,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc18bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:32, skipping insertion in model container [2022-04-08 02:11:32,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:11:32" (1/1) ... [2022-04-08 02:11:32,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:11:32,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:11:33,013 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/prod4br-ll_valuebound1.c[524,537] [2022-04-08 02:11:33,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:11:33,053 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:11:33,063 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/prod4br-ll_valuebound1.c[524,537] [2022-04-08 02:11:33,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:11:33,084 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:11:33,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33 WrapperNode [2022-04-08 02:11:33,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:11:33,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:11:33,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:11:33,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:11:33,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:11:33,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:11:33,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:11:33,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:11:33,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:11:33,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:11:33,135 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-08 02:11:33,157 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-08 02:11:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:11:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:11:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:11:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 02:11:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 02:11:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:11:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:11:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:11:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:11:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:11:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:11:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:11:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:11:33,222 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:11:33,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:11:33,384 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:11:33,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:11:33,390 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:11:33,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:11:33 BoogieIcfgContainer [2022-04-08 02:11:33,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:11:33,392 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:11:33,392 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:11:33,396 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:11:33,399 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:11:33" (1/1) ... [2022-04-08 02:11:33,400 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:11:33,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:11:33 BasicIcfg [2022-04-08 02:11:33,451 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:11:33,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:11:33,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:11:33,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:11:33,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:11:32" (1/4) ... [2022-04-08 02:11:33,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fabde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:11:33, skipping insertion in model container [2022-04-08 02:11:33,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:11:33" (2/4) ... [2022-04-08 02:11:33,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fabde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:11:33, skipping insertion in model container [2022-04-08 02:11:33,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:11:33" (3/4) ... [2022-04-08 02:11:33,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fabde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:11:33, skipping insertion in model container [2022-04-08 02:11:33,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:11:33" (4/4) ... [2022-04-08 02:11:33,458 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound1.cqvasr [2022-04-08 02:11:33,462 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:11:33,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:11:33,508 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:11:33,513 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-08 02:11:33,513 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:11:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 02:11:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:11:33,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:11:33,535 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:11:33,536 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:11:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:11:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash 574541465, now seen corresponding path program 1 times [2022-04-08 02:11:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:11:33,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647828675] [2022-04-08 02:11:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:11:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:11:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:11:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:33,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-08 02:11:33,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 02:11:33,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 02:11:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 02:11:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:33,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 02:11:33,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 02:11:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 02:11:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:33,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 02:11:33,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 02:11:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 02:11:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:33,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 02:11:33,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 02:11:33,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:11:33,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-08 02:11:33,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 02:11:33,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 02:11:33,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 02:11:33,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {37#true} is VALID [2022-04-08 02:11:33,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 02:11:33,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 02:11:33,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 02:11:33,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {38#false} is VALID [2022-04-08 02:11:33,794 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 02:11:33,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 02:11:33,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,796 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 02:11:33,797 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 02:11:33,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 02:11:33,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,800 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 02:11:33,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {38#false} is VALID [2022-04-08 02:11:33,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} [101] L47-2-->L34-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,801 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {38#false} is VALID [2022-04-08 02:11:33,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [107] __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] {38#false} is VALID [2022-04-08 02:11:33,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} [111] 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[] {38#false} is VALID [2022-04-08 02:11:33,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 02:11:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:11:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:11:33,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647828675] [2022-04-08 02:11:33,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647828675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:11:33,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:11:33,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 02:11:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379360577] [2022-04-08 02:11:33,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:11:33,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 02:11:33,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:11:33,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:11:33,857 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-08 02:11:33,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 02:11:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:11:33,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 02:11:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:11:33,887 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:11:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:11:34,063 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-08 02:11:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 02:11:34,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 02:11:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:11:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:11:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-08 02:11:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:11:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-08 02:11:34,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-08 02:11:34,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:11:34,212 INFO L225 Difference]: With dead ends: 61 [2022-04-08 02:11:34,212 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 02:11:34,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-08 02:11:34,221 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:11:34,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:11:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 02:11:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 02:11:34,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:11:34,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:11:34,255 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:11:34,255 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:11:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:11:34,263 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-08 02:11:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 02:11:34,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:11:34,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:11:34,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 02:11:34,266 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 02:11:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:11:34,280 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-08 02:11:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 02:11:34,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:11:34,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:11:34,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:11:34,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:11:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:11:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-08 02:11:34,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-08 02:11:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:11:34,289 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-08 02:11:34,290 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:11:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 02:11:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:11:34,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:11:34,291 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:11:34,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:11:34,292 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:11:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:11:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2145419015, now seen corresponding path program 1 times [2022-04-08 02:11:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:11:34,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360346021] [2022-04-08 02:11:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:11:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:11:34,322 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:11:34,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223014477] [2022-04-08 02:11:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:11:34,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:11:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:11:34,325 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-08 02:11:34,349 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-08 02:11:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:34,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 02:11:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:34,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:11:34,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-08 02:11:34,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {239#true} is VALID [2022-04-08 02:11:34,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-08 02:11:34,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-08 02:11:34,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-08 02:11:34,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {239#true} is VALID [2022-04-08 02:11:34,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {239#true} is VALID [2022-04-08 02:11:34,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:11:34,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:34,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:34,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {239#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:11:34,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:11:34,928 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {239#true} is VALID [2022-04-08 02:11:34,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:11:34,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:34,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:34,935 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {295#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-08 02:11:34,935 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {239#true} is VALID [2022-04-08 02:11:34,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:11:34,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:34,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:34,938 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {295#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {311#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 02:11:34,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {311#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:11:34,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:11:34,941 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:11:34,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __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] {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:11:34,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} [111] 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[] {240#false} is VALID [2022-04-08 02:11:34,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-08 02:11:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:11:34,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:11:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:11:34,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360346021] [2022-04-08 02:11:34,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:11:34,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223014477] [2022-04-08 02:11:34,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223014477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:11:34,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:11:34,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 02:11:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21130643] [2022-04-08 02:11:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:11:34,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-08 02:11:34,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:11:34,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 02:11:34,970 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-08 02:11:34,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 02:11:34,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:11:34,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 02:11:34,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 02:11:34,971 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 02:11:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:11:35,434 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-08 02:11:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 02:11:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-08 02:11:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:11:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 02:11:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-08 02:11:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 02:11:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-08 02:11:35,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-04-08 02:11:35,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:11:35,517 INFO L225 Difference]: With dead ends: 55 [2022-04-08 02:11:35,518 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 02:11:35,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-08 02:11:35,520 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:11:35,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 118 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:11:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 02:11:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-08 02:11:35,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:11:35,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:11:35,553 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:11:35,558 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:11:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:11:35,561 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-08 02:11:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-08 02:11:35,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:11:35,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:11:35,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-08 02:11:35,563 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-08 02:11:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:11:35,569 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-08 02:11:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-08 02:11:35,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:11:35,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:11:35,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:11:35,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:11:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:11:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-04-08 02:11:35,574 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2022-04-08 02:11:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:11:35,574 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-04-08 02:11:35,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 02:11:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-08 02:11:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 02:11:35,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:11:35,576 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:11:35,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 02:11:35,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:11:35,794 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:11:35,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:11:35,795 INFO L85 PathProgramCache]: Analyzing trace with hash -257170002, now seen corresponding path program 1 times [2022-04-08 02:11:35,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:11:35,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166033934] [2022-04-08 02:11:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:11:35,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:11:35,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:11:35,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636667322] [2022-04-08 02:11:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:11:35,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:11:35,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:11:35,817 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-08 02:11:35,819 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-08 02:11:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:35,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 02:11:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:11:35,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:11:46,131 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 02:11:46,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {550#true} is VALID [2022-04-08 02:11:46,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {550#true} is VALID [2022-04-08 02:11:46,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {550#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:46,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {550#true} is VALID [2022-04-08 02:11:46,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,745 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {550#true} {550#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:46,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {550#true} is VALID [2022-04-08 02:11:46,745 INFO L272 TraceCheckUtils]: 12: Hoare triple {550#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:46,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {550#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {550#true} is VALID [2022-04-08 02:11:46,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {550#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:46,746 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {550#true} {550#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:46,746 INFO L272 TraceCheckUtils]: 17: Hoare triple {550#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:46,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {550#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {609#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:11:46,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {609#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {613#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:46,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {613#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {613#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:11:46,750 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {613#(not (= |assume_abort_if_not_#in~cond| 0))} {550#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {620#(<= 1 main_~y~0)} is VALID [2022-04-08 02:11:46,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {620#(<= 1 main_~y~0)} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-08 02:11:46,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-08 02:11:46,751 INFO L272 TraceCheckUtils]: 24: Hoare triple {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {550#true} is VALID [2022-04-08 02:11:46,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {550#true} [107] __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] {634#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:11:46,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {634#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [112] 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[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:11:46,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:11:48,755 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {645#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-08 02:11:48,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {645#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {649#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-08 02:11:48,761 INFO L272 TraceCheckUtils]: 30: Hoare triple {649#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:11:48,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __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] {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:11:48,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} [111] 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[] {551#false} is VALID [2022-04-08 02:11:48,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {551#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#false} is VALID [2022-04-08 02:11:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 02:11:48,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:11:59,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {551#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#false} is VALID [2022-04-08 02:11:59,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} [111] 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[] {551#false} is VALID [2022-04-08 02:11:59,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __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] {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:11:59,432 INFO L272 TraceCheckUtils]: 30: Hoare triple {673#(= main_~q~0 (* main_~y~0 main_~x~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:11:59,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {677#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {673#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-08 02:11:59,434 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} {550#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {677#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-08 02:11:59,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:11:59,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {690#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [112] 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[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:11:59,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {550#true} [107] __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] {690#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 02:11:59,436 INFO L272 TraceCheckUtils]: 24: Hoare triple {550#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {550#true} is VALID [2022-04-08 02:11:59,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {550#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {550#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {550#true} is VALID [2022-04-08 02:11:59,436 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {550#true} {550#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:59,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {550#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {550#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {550#true} is VALID [2022-04-08 02:11:59,437 INFO L272 TraceCheckUtils]: 17: Hoare triple {550#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:59,437 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {550#true} {550#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:59,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {550#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {550#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {550#true} is VALID [2022-04-08 02:11:59,438 INFO L272 TraceCheckUtils]: 12: Hoare triple {550#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:59,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {550#true} is VALID [2022-04-08 02:11:59,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {550#true} {550#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:59,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {550#true} is VALID [2022-04-08 02:11:59,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {550#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {550#true} is VALID [2022-04-08 02:11:59,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {550#true} is VALID [2022-04-08 02:11:59,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {550#true} is VALID [2022-04-08 02:11:59,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#true} is VALID [2022-04-08 02:11:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:11:59,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:11:59,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166033934] [2022-04-08 02:11:59,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:11:59,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636667322] [2022-04-08 02:11:59,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636667322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:11:59,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:11:59,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-08 02:11:59,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891502048] [2022-04-08 02:11:59,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:11:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-08 02:11:59,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:11:59,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 02:12:01,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 02:12:01,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 02:12:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:12:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 02:12:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-08 02:12:01,480 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 02:12:07,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 02:12:10,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 02:12:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:10,071 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-08 02:12:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 02:12:10,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-08 02:12:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:12:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 02:12:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 02:12:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 02:12:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 02:12:10,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-08 02:12:10,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:12:10,137 INFO L225 Difference]: With dead ends: 49 [2022-04-08 02:12:10,137 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 02:12:10,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-08 02:12:10,139 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 02:12:10,139 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 223 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 02:12:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 02:12:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-08 02:12:10,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:12:10,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:10,169 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:10,169 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:10,172 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-08 02:12:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-08 02:12:10,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:12:10,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:12:10,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-08 02:12:10,182 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-08 02:12:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:10,190 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-08 02:12:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-08 02:12:10,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:12:10,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:12:10,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:12:10,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:12:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-04-08 02:12:10,195 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2022-04-08 02:12:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:12:10,195 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-04-08 02:12:10,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 02:12:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 02:12:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 02:12:10,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:12:10,199 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:12:10,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 02:12:10,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 02:12:10,429 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:12:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:12:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1424936990, now seen corresponding path program 1 times [2022-04-08 02:12:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:12:10,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259471172] [2022-04-08 02:12:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:12:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:12:10,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:12:10,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918279149] [2022-04-08 02:12:10,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:12:10,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:12:10,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:12:10,449 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-08 02:12:10,469 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-08 02:12:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:12:10,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 02:12:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:12:10,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:12:10,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {1003#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1003#true} is VALID [2022-04-08 02:12:10,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {1003#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1003#true} is VALID [2022-04-08 02:12:10,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {1003#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 02:12:10,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:12:10,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:10,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:10,819 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1003#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:12:10,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:12:10,820 INFO L272 TraceCheckUtils]: 12: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 02:12:10,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1003#true} is VALID [2022-04-08 02:12:10,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {1003#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1003#true} {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:12:10,821 INFO L272 TraceCheckUtils]: 17: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 02:12:10,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1003#true} is VALID [2022-04-08 02:12:10,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {1003#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {1003#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,822 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1003#true} {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:12:10,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 02:12:10,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 02:12:10,824 INFO L272 TraceCheckUtils]: 24: Hoare triple {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1003#true} is VALID [2022-04-08 02:12:10,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {1003#true} [107] __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] {1003#true} is VALID [2022-04-08 02:12:10,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {1003#true} [112] 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[] {1003#true} is VALID [2022-04-08 02:12:10,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {1003#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:10,825 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1003#true} {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 02:12:10,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-08 02:12:10,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-08 02:12:10,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-08 02:12:10,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} [121] L47-->L47-2: Formula: (and (= (let ((.cse0 (mod v_main_~b~0_8 2))) (ite (and (< v_main_~b~0_8 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1) (= v_main_~b~0_7 (+ (- 1) v_main_~b~0_8)) (= v_main_~q~0_4 (+ v_main_~q~0_5 (* v_main_~a~0_8 v_main_~p~0_5))) (= (let ((.cse1 (mod v_main_~a~0_8 2))) (ite (and (< v_main_~a~0_8 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 0)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_7, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1004#false} is VALID [2022-04-08 02:12:10,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {1004#false} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1004#false} is VALID [2022-04-08 02:12:10,829 INFO L272 TraceCheckUtils]: 34: Hoare triple {1004#false} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1004#false} is VALID [2022-04-08 02:12:10,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {1004#false} [107] __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] {1004#false} is VALID [2022-04-08 02:12:10,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {1004#false} [111] 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[] {1004#false} is VALID [2022-04-08 02:12:10,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {1004#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1004#false} is VALID [2022-04-08 02:12:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 02:12:10,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:12:11,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {1004#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1004#false} is VALID [2022-04-08 02:12:11,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {1004#false} [111] 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[] {1004#false} is VALID [2022-04-08 02:12:11,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {1004#false} [107] __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] {1004#false} is VALID [2022-04-08 02:12:11,276 INFO L272 TraceCheckUtils]: 34: Hoare triple {1004#false} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1004#false} is VALID [2022-04-08 02:12:11,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {1004#false} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1004#false} is VALID [2022-04-08 02:12:11,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {1139#(not (= (mod main_~a~0 2) 0))} [121] L47-->L47-2: Formula: (and (= (let ((.cse0 (mod v_main_~b~0_8 2))) (ite (and (< v_main_~b~0_8 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1) (= v_main_~b~0_7 (+ (- 1) v_main_~b~0_8)) (= v_main_~q~0_4 (+ v_main_~q~0_5 (* v_main_~a~0_8 v_main_~p~0_5))) (= (let ((.cse1 (mod v_main_~a~0_8 2))) (ite (and (< v_main_~a~0_8 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 0)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_7, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1004#false} is VALID [2022-04-08 02:12:11,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {1139#(not (= (mod main_~a~0 2) 0))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {1139#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-08 02:12:11,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {1139#(not (= (mod main_~a~0 2) 0))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1139#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-08 02:12:11,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1139#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-08 02:12:11,278 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1003#true} {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-08 02:12:11,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {1003#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {1003#true} [112] 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[] {1003#true} is VALID [2022-04-08 02:12:11,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {1003#true} [107] __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] {1003#true} is VALID [2022-04-08 02:12:11,279 INFO L272 TraceCheckUtils]: 24: Hoare triple {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1003#true} is VALID [2022-04-08 02:12:11,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-08 02:12:11,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-08 02:12:11,284 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1003#true} {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-08 02:12:11,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {1003#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1003#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1003#true} is VALID [2022-04-08 02:12:11,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 02:12:11,285 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1003#true} {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-08 02:12:11,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {1003#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1003#true} is VALID [2022-04-08 02:12:11,285 INFO L272 TraceCheckUtils]: 12: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 02:12:11,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-08 02:12:11,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1003#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-08 02:12:11,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:11,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:11,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1217#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 02:12:11,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {1003#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 02:12:11,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1003#true} is VALID [2022-04-08 02:12:11,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {1003#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1003#true} is VALID [2022-04-08 02:12:11,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {1003#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 02:12:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 02:12:11,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:12:11,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259471172] [2022-04-08 02:12:11,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:12:11,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918279149] [2022-04-08 02:12:11,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918279149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:12:11,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:12:11,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-08 02:12:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324579742] [2022-04-08 02:12:11,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:12:11,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 38 [2022-04-08 02:12:11,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:12:11,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:12:11,337 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-08 02:12:11,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 02:12:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:12:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 02:12:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 02:12:11,338 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:12:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:11,692 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 02:12:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 02:12:11,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 38 [2022-04-08 02:12:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:12:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:12:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 02:12:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:12:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 02:12:11,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 02:12:11,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:12:11,746 INFO L225 Difference]: With dead ends: 60 [2022-04-08 02:12:11,746 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 02:12:11,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-08 02:12:11,748 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:12:11,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 115 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:12:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 02:12:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 02:12:11,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:12:11,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:11,778 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:11,778 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:11,780 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 02:12:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-08 02:12:11,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:12:11,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:12:11,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-08 02:12:11,781 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-08 02:12:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:11,782 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 02:12:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-08 02:12:11,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:12:11,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:12:11,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:12:11,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:12:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:12:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-08 02:12:11,785 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 38 [2022-04-08 02:12:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:12:11,785 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-08 02:12:11,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-08 02:12:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-08 02:12:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 02:12:11,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:12:11,786 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:12:11,814 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-08 02:12:12,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:12:12,008 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:12:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:12:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1396307839, now seen corresponding path program 1 times [2022-04-08 02:12:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:12:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592872914] [2022-04-08 02:12:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:12:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:12:12,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:12:12,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262820895] [2022-04-08 02:12:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:12:12,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:12:12,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:12:12,032 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-08 02:12:12,045 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-08 02:12:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:12:12,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 02:12:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:12:12,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:12:13,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {1473#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:13,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {1473#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1473#true} is VALID [2022-04-08 02:12:13,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {1473#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:13,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1473#true} {1473#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:13,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {1473#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:13,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {1473#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1473#true} is VALID [2022-04-08 02:12:13,136 INFO L272 TraceCheckUtils]: 6: Hoare triple {1473#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:13,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {1473#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:12:13,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:13,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:13,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} {1473#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:12:13,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 02:12:13,141 INFO L272 TraceCheckUtils]: 12: Hoare triple {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:13,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 02:12:13,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:13,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 02:12:13,144 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-08 02:12:13,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:13,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {1473#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1473#true} is VALID [2022-04-08 02:12:13,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:13,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {1473#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:13,145 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1473#true} {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-08 02:12:13,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,146 INFO L272 TraceCheckUtils]: 24: Hoare triple {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1473#true} is VALID [2022-04-08 02:12:13,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#true} [107] __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] {1558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:12:13,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {1558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [112] 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[] {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:12:13,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:12:13,148 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [122] L47-->L47-2: Formula: (and (or (not (= (let ((.cse0 (mod v_main_~a~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~a~0_10 0)) (+ (- 2) .cse0) .cse0)) 0)) (not (= (let ((.cse1 (mod v_main_~b~0_10 2))) (ite (and (< v_main_~b~0_10 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 1))) (= v_main_~q~0_6 (+ v_main_~q~0_7 (* v_main_~p~0_6 (+ v_main_~a~0_9 v_main_~b~0_9 1)))) (= v_main_~b~0_9 (+ (- 1) v_main_~b~0_10)) (= v_main_~a~0_9 (+ (- 1) v_main_~a~0_10))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_10, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_10} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~a~0] {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-08 02:12:13,155 INFO L272 TraceCheckUtils]: 34: Hoare triple {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:12:13,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __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] {1593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:12:13,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= 1 __VERIFIER_assert_~cond)} [111] 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[] {1474#false} is VALID [2022-04-08 02:12:13,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {1474#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1474#false} is VALID [2022-04-08 02:12:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 02:12:13,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:12:33,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {1474#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1474#false} is VALID [2022-04-08 02:12:33,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= 1 __VERIFIER_assert_~cond)} [111] 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[] {1474#false} is VALID [2022-04-08 02:12:33,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __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] {1593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:12:33,720 INFO L272 TraceCheckUtils]: 34: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:12:33,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 02:12:33,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [122] L47-->L47-2: Formula: (and (or (not (= (let ((.cse0 (mod v_main_~a~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~a~0_10 0)) (+ (- 2) .cse0) .cse0)) 0)) (not (= (let ((.cse1 (mod v_main_~b~0_10 2))) (ite (and (< v_main_~b~0_10 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 1))) (= v_main_~q~0_6 (+ v_main_~q~0_7 (* v_main_~p~0_6 (+ v_main_~a~0_9 v_main_~b~0_9 1)))) (= v_main_~b~0_9 (+ (- 1) v_main_~b~0_10)) (= v_main_~a~0_9 (+ (- 1) v_main_~a~0_10))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_10, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_10} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~a~0] {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 02:12:33,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 02:12:33,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 02:12:33,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#(or (= main_~a~0 0) (= main_~b~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 02:12:33,728 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} {1473#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1625#(or (= main_~a~0 0) (= main_~b~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 02:12:33,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:12:33,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {1638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [112] 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[] {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:12:33,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#true} [107] __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] {1638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 02:12:33,729 INFO L272 TraceCheckUtils]: 24: Hoare triple {1473#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1473#true} is VALID [2022-04-08 02:12:33,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {1473#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {1473#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1473#true} is VALID [2022-04-08 02:12:33,743 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1473#true} {1473#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:33,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {1473#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {1473#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1473#true} is VALID [2022-04-08 02:12:33,743 INFO L272 TraceCheckUtils]: 17: Hoare triple {1473#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1473#true} {1473#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {1473#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {1473#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L272 TraceCheckUtils]: 12: Hoare triple {1473#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {1473#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1473#true} {1473#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:33,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {1473#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1473#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1473#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1473#true} is VALID [2022-04-08 02:12:33,745 INFO L272 TraceCheckUtils]: 6: Hoare triple {1473#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1473#true} is VALID [2022-04-08 02:12:33,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {1473#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1473#true} is VALID [2022-04-08 02:12:33,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {1473#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1473#true} {1473#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1473#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {1473#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1473#true} is VALID [2022-04-08 02:12:33,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {1473#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1473#true} is VALID [2022-04-08 02:12:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 02:12:33,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:12:33,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592872914] [2022-04-08 02:12:33,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:12:33,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262820895] [2022-04-08 02:12:33,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262820895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:12:33,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:12:33,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-08 02:12:33,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784672497] [2022-04-08 02:12:33,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:12:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 38 [2022-04-08 02:12:33,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:12:33,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 02:12:33,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:12:33,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 02:12:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:12:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 02:12:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-08 02:12:33,807 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 02:12:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:34,406 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 02:12:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 02:12:34,406 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 38 [2022-04-08 02:12:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:12:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 02:12:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-08 02:12:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 02:12:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-08 02:12:34,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 53 transitions. [2022-04-08 02:12:34,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:12:34,466 INFO L225 Difference]: With dead ends: 56 [2022-04-08 02:12:34,467 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 02:12:34,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-08 02:12:34,468 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:12:34,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 132 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:12:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 02:12:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 02:12:34,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:12:34,469 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-08 02:12:34,469 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-08 02:12:34,469 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-08 02:12:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:34,469 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:12:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:12:34,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:12:34,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:12:34,470 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-08 02:12:34,470 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-08 02:12:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:12:34,470 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:12:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:12:34,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:12:34,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:12:34,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:12:34,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:12:34,471 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-08 02:12:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 02:12:34,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-08 02:12:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:12:34,471 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 02:12:34,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 02:12:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:12:34,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:12:34,474 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:12:34,498 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-08 02:12:34,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:12:34,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 02:12:35,181 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 02:12:35,181 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:12:35,181 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:12:35,181 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 02:12:35,181 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 02:12:35,181 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:12:35,181 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:12:35,181 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-08 02:12:35,181 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-08 02:12:35,181 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-08 02:12:35,181 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-08 02:12:35,181 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-08 02:12:35,182 INFO L885 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-08 02:12:35,182 INFO L882 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-08 02:12:35,182 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-08 02:12:35,182 INFO L878 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-08 02:12:35,182 INFO L882 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-08 02:12:35,182 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (let ((.cse1 (<= main_~x~0 1)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= main_~y~0 1)) (.cse4 (= main_~p~0 1))) (or (let ((.cse0 (+ main_~b~0 1))) (and (<= 0 main_~y~0) (not (= .cse0 0)) .cse1 .cse2 (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) (= .cse0 main_~y~0) .cse3 .cse4)) (and .cse1 (= main_~b~0 main_~y~0) .cse2 (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) .cse3 .cse4))) [2022-04-08 02:12:35,182 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (<= main_~y~0 1))) (or (and (= main_~a~0 0) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~q~0 0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~b~0) .cse0 .cse1) (and (<= main_~x~0 1) (<= 0 main_~a~0) (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse0 (= (+ main_~b~0 1) main_~y~0) .cse1 (= main_~p~0 1)))) [2022-04-08 02:12:35,182 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (<= main_~x~0 1)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= main_~y~0 1)) (.cse4 (= main_~p~0 1))) (or (let ((.cse0 (+ main_~b~0 1))) (and (<= 0 main_~y~0) (not (= .cse0 0)) .cse1 .cse2 (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) (= .cse0 main_~y~0) .cse3 .cse4)) (and .cse1 (= main_~b~0 main_~y~0) .cse2 (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) .cse3 .cse4))) [2022-04-08 02:12:35,182 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (<= main_~y~0 1))) (or (and (= main_~a~0 0) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~q~0 0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~b~0) .cse0 .cse1) (and (<= main_~x~0 1) (<= 0 main_~a~0) (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse0 (= (+ main_~b~0 1) main_~y~0) .cse1 (= main_~p~0 1)))) [2022-04-08 02:12:35,182 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2022-04-08 02:12:35,182 INFO L882 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-04-08 02:12:35,182 INFO L882 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2022-04-08 02:12:35,182 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 60) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 60) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-08 02:12:35,183 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-08 02:12:35,186 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-08 02:12:35,187 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:12:35,195 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:12:35,195 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 02:12:35,195 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:12:35,196 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:12:35,197 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:12:35,197 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-08 02:12:35,197 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-08 02:12:35,197 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 02:12:35,197 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 02:12:35,197 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 02:12:35,203 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:12:35,203 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 02:12:35,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:12:35 BasicIcfg [2022-04-08 02:12:35,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:12:35,219 INFO L158 Benchmark]: Toolchain (without parser) took 62381.13ms. Allocated memory was 181.4MB in the beginning and 244.3MB in the end (delta: 62.9MB). Free memory was 129.6MB in the beginning and 114.5MB in the end (delta: 15.1MB). Peak memory consumption was 79.8MB. Max. memory is 8.0GB. [2022-04-08 02:12:35,219 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 145.7MB in the beginning and 145.6MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:12:35,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.56ms. Allocated memory was 181.4MB in the beginning and 244.3MB in the end (delta: 62.9MB). Free memory was 129.4MB in the beginning and 220.9MB in the end (delta: -91.5MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-08 02:12:35,221 INFO L158 Benchmark]: Boogie Preprocessor took 25.47ms. Allocated memory is still 244.3MB. Free memory was 220.9MB in the beginning and 219.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:12:35,221 INFO L158 Benchmark]: RCFGBuilder took 279.63ms. Allocated memory is still 244.3MB. Free memory was 219.5MB in the beginning and 206.2MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-08 02:12:35,221 INFO L158 Benchmark]: IcfgTransformer took 59.28ms. Allocated memory is still 244.3MB. Free memory was 206.2MB in the beginning and 204.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 02:12:35,221 INFO L158 Benchmark]: TraceAbstraction took 61765.48ms. Allocated memory is still 244.3MB. Free memory was 203.8MB in the beginning and 114.5MB in the end (delta: 89.3MB). Peak memory consumption was 90.3MB. Max. memory is 8.0GB. [2022-04-08 02:12:35,223 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.11ms. Allocated memory is still 181.4MB. Free memory was 145.7MB in the beginning and 145.6MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.56ms. Allocated memory was 181.4MB in the beginning and 244.3MB in the end (delta: 62.9MB). Free memory was 129.4MB in the beginning and 220.9MB in the end (delta: -91.5MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.47ms. Allocated memory is still 244.3MB. Free memory was 220.9MB in the beginning and 219.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 279.63ms. Allocated memory is still 244.3MB. Free memory was 219.5MB in the beginning and 206.2MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 59.28ms. Allocated memory is still 244.3MB. Free memory was 206.2MB in the beginning and 204.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 61765.48ms. Allocated memory is still 244.3MB. Free memory was 203.8MB in the beginning and 114.5MB in the end (delta: 89.3MB). Peak memory consumption was 90.3MB. 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 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.7s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 518 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 633 IncrementalHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 121 mSDtfsCounter, 633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, InterpolantAutomatonStates: 44, 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, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 34 PreInvPairs, 44 NumberOfFragments, 297 HoareAnnotationTreeSize, 34 FomulaSimplifications, 88 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 374 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 46.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 SizeOfPredicates, 18 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 92/116 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: 34]: Loop Invariant Derived loop invariant: ((((((((0 <= y && !(b + 1 == 0)) && x <= 1) && 0 <= a) && a + 1 == x) && q == b * p + a * p + p) && b + 1 == y) && y <= 1) && p == 1) || (((((((x <= 1 && b == y) && 0 <= a) && q == 0) && 1 <= y) && a == x) && y <= 1) && p == 1) RESULT: Ultimate proved your program to be correct! [2022-04-08 02:12:35,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...