/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/lcm2_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 01:00:15,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 01:00:15,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 01:00:15,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 01:00:15,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 01:00:15,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 01:00:15,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 01:00:15,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 01:00:15,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 01:00:15,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 01:00:15,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 01:00:15,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 01:00:15,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 01:00:15,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 01:00:15,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 01:00:15,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 01:00:15,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 01:00:15,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 01:00:15,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 01:00:15,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 01:00:15,479 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 01:00:15,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 01:00:15,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 01:00:15,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 01:00:15,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 01:00:15,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 01:00:15,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 01:00:15,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 01:00:15,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 01:00:15,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 01:00:15,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 01:00:15,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 01:00:15,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 01:00:15,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 01:00:15,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 01:00:15,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 01:00:15,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 01:00:15,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 01:00:15,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 01:00:15,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 01:00:15,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 01:00:15,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 01:00:15,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 01:00:15,515 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 01:00:15,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 01:00:15,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 01:00:15,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 01:00:15,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 01:00:15,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 01:00:15,517 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 01:00:15,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 01:00:15,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 01:00:15,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 01:00:15,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 01:00:15,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:00:15,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 01:00:15,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 01:00:15,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 01:00:15,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 01:00:15,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 01:00:15,519 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 01:00:15,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 01:00:15,519 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 01:00:15,520 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 01:00:15,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 01:00:15,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 01:00:15,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 01:00:15,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 01:00:15,706 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 01:00:15,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound20.c [2022-04-28 01:00:15,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb31d7d7/9fa1103b54ab4380b89998544fad7b94/FLAGc2a380ff9 [2022-04-28 01:00:16,032 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 01:00:16,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound20.c [2022-04-28 01:00:16,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb31d7d7/9fa1103b54ab4380b89998544fad7b94/FLAGc2a380ff9 [2022-04-28 01:00:16,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb31d7d7/9fa1103b54ab4380b89998544fad7b94 [2022-04-28 01:00:16,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 01:00:16,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 01:00:16,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 01:00:16,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 01:00:16,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 01:00:16,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa40ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16, skipping insertion in model container [2022-04-28 01:00:16,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 01:00:16,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 01:00:16,661 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/lcm2_unwindbound20.c[537,550] [2022-04-28 01:00:16,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:00:16,677 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 01:00:16,685 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/lcm2_unwindbound20.c[537,550] [2022-04-28 01:00:16,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:00:16,697 INFO L208 MainTranslator]: Completed translation [2022-04-28 01:00:16,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16 WrapperNode [2022-04-28 01:00:16,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 01:00:16,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 01:00:16,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 01:00:16,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 01:00:16,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 01:00:16,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 01:00:16,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 01:00:16,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 01:00:16,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:00:16,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:00:16,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 01:00:16,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 01:00:16,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 01:00:16,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 01:00:16,828 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 01:00:16,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 01:00:16,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 01:00:16,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 01:00:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 01:00:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 01:00:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 01:00:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 01:00:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 01:00:16,876 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 01:00:16,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 01:00:16,984 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 01:00:16,989 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 01:00:16,989 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 01:00:16,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:00:16 BoogieIcfgContainer [2022-04-28 01:00:16,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 01:00:16,991 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 01:00:16,991 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 01:00:16,992 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 01:00:16,994 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:00:16" (1/1) ... [2022-04-28 01:00:16,995 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 01:00:17,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:00:17 BasicIcfg [2022-04-28 01:00:17,014 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 01:00:17,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 01:00:17,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 01:00:17,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 01:00:17,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:00:16" (1/4) ... [2022-04-28 01:00:17,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:00:17, skipping insertion in model container [2022-04-28 01:00:17,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:00:16" (2/4) ... [2022-04-28 01:00:17,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:00:17, skipping insertion in model container [2022-04-28 01:00:17,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:00:16" (3/4) ... [2022-04-28 01:00:17,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:00:17, skipping insertion in model container [2022-04-28 01:00:17,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:00:17" (4/4) ... [2022-04-28 01:00:17,019 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_unwindbound20.cqvasr [2022-04-28 01:00:17,028 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 01:00:17,028 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 01:00:17,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 01:00:17,106 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ec56bcb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64785074 [2022-04-28 01:00:17,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 01:00:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-28 01:00:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 01:00:17,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:00:17,121 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:00:17,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:00:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:00:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash -293305999, now seen corresponding path program 1 times [2022-04-28 01:00:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:00:17,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366844940] [2022-04-28 01:00:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:00:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 01:00:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {35#true} is VALID [2022-04-28 01:00:17,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-28 01:00:17,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-28 01:00:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 01:00:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-28 01:00:17,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 01:00:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-28 01:00:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 01:00:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-28 01:00:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 01:00:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-28 01:00:17,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 01:00:17,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {35#true} is VALID [2022-04-28 01:00:17,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-28 01:00:17,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-28 01:00:17,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-28 01:00:17,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {35#true} is VALID [2022-04-28 01:00:17,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#true} is VALID [2022-04-28 01:00:17,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-28 01:00:17,377 INFO L272 TraceCheckUtils]: 11: Hoare triple {36#false} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-28 01:00:17,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,379 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36#false} {36#false} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-28 01:00:17,380 INFO L272 TraceCheckUtils]: 16: Hoare triple {36#false} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#true} is VALID [2022-04-28 01:00:17,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,383 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {36#false} {36#false} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-28 01:00:17,383 INFO L272 TraceCheckUtils]: 21: Hoare triple {36#false} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-28 01:00:17,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#true} [84] 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] {35#true} is VALID [2022-04-28 01:00:17,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,385 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36#false} {36#false} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-28 01:00:17,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {36#false} is VALID [2022-04-28 01:00:17,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} [91] L42-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,386 INFO L272 TraceCheckUtils]: 28: Hoare triple {36#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {36#false} is VALID [2022-04-28 01:00:17,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {36#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {36#false} is VALID [2022-04-28 01:00:17,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-28 01:00:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 01:00:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:00:17,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366844940] [2022-04-28 01:00:17,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366844940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:00:17,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:00:17,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 01:00:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3141479] [2022-04-28 01:00:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:00:17,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 01:00:17,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:00:17,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:17,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:17,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 01:00:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:00:17,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 01:00:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:00:17,457 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:17,607 INFO L93 Difference]: Finished difference Result 58 states and 82 transitions. [2022-04-28 01:00:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 01:00:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 01:00:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:00:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-28 01:00:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-28 01:00:17,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-04-28 01:00:17,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:17,738 INFO L225 Difference]: With dead ends: 58 [2022-04-28 01:00:17,738 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 01:00:17,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:00:17,742 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:00:17,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:00:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 01:00:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 01:00:17,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:00:17,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 01:00:17,762 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 01:00:17,762 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 01:00:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:17,764 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 01:00:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 01:00:17,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:17,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:17,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 28 states. [2022-04-28 01:00:17,766 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 28 states. [2022-04-28 01:00:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:17,768 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 01:00:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 01:00:17,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:17,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:17,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:00:17,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:00:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 01:00:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-28 01:00:17,771 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2022-04-28 01:00:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:00:17,771 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-28 01:00:17,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 01:00:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 01:00:17,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:00:17,772 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:00:17,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 01:00:17,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:00:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:00:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1648116036, now seen corresponding path program 1 times [2022-04-28 01:00:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:00:17,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300889927] [2022-04-28 01:00:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:00:17,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:00:17,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538183396] [2022-04-28 01:00:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:17,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:00:17,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:00:17,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:00:17,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 01:00:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 01:00:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:17,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:00:18,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {235#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-28 01:00:18,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(<= ~counter~0 0)} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#(<= ~counter~0 0)} {235#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#(<= ~counter~0 0)} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#(<= ~counter~0 0)} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#(<= ~counter~0 0)} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(<= ~counter~0 0)} [84] 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] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(<= ~counter~0 0)} [87] 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[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,106 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,107 INFO L272 TraceCheckUtils]: 11: Hoare triple {243#(<= ~counter~0 0)} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(<= ~counter~0 0)} [84] 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] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(<= ~counter~0 0)} [87] 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[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,108 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,109 INFO L272 TraceCheckUtils]: 16: Hoare triple {243#(<= ~counter~0 0)} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#(<= ~counter~0 0)} [84] 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] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#(<= ~counter~0 0)} [87] 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[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,111 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,111 INFO L272 TraceCheckUtils]: 21: Hoare triple {243#(<= ~counter~0 0)} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {243#(<= ~counter~0 0)} [84] 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] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#(<= ~counter~0 0)} [87] 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[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,113 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {243#(<= ~counter~0 0)} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {243#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:18,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#(<= ~counter~0 0)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {322#(<= |main_#t~post6| 0)} is VALID [2022-04-28 01:00:18,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {322#(<= |main_#t~post6| 0)} [94] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {236#false} is VALID [2022-04-28 01:00:18,115 INFO L272 TraceCheckUtils]: 29: Hoare triple {236#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {236#false} is VALID [2022-04-28 01:00:18,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {236#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {236#false} is VALID [2022-04-28 01:00:18,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {236#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {236#false} is VALID [2022-04-28 01:00:18,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {236#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#false} is VALID [2022-04-28 01:00:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 01:00:18,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:00:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:00:18,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300889927] [2022-04-28 01:00:18,117 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:00:18,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538183396] [2022-04-28 01:00:18,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538183396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:00:18,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:00:18,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 01:00:18,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834035896] [2022-04-28 01:00:18,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:00:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 01:00:18,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:00:18,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:18,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:18,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 01:00:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:00:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 01:00:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 01:00:18,143 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:18,211 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 01:00:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 01:00:18,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 01:00:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:00:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-28 01:00:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-28 01:00:18,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-28 01:00:18,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:18,250 INFO L225 Difference]: With dead ends: 36 [2022-04-28 01:00:18,251 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 01:00:18,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 01:00:18,252 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:00:18,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:00:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 01:00:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 01:00:18,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:00:18,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 01:00:18,260 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 01:00:18,260 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 01:00:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:18,261 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 01:00:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 01:00:18,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:18,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:18,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 01:00:18,262 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 01:00:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:18,264 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 01:00:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 01:00:18,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:18,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:18,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:00:18,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:00:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 01:00:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 01:00:18,266 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 33 [2022-04-28 01:00:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:00:18,266 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 01:00:18,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 01:00:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 01:00:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 01:00:18,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:00:18,267 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:00:18,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 01:00:18,483 WARN L477 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-28 01:00:18,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:00:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:00:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1647043560, now seen corresponding path program 1 times [2022-04-28 01:00:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:00:18,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48316192] [2022-04-28 01:00:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:00:18,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:00:18,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366479018] [2022-04-28 01:00:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:18,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:00:18,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:00:18,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:00:18,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 01:00:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:18,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 01:00:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:18,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:00:18,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {490#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {490#true} is VALID [2022-04-28 01:00:18,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {490#true} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {490#true} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {490#true} is VALID [2022-04-28 01:00:18,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {490#true} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {490#true} is VALID [2022-04-28 01:00:18,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#true} [84] 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] {490#true} is VALID [2022-04-28 01:00:18,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#true} [87] 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[] {490#true} is VALID [2022-04-28 01:00:18,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {490#true} {490#true} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {490#true} is VALID [2022-04-28 01:00:18,980 INFO L272 TraceCheckUtils]: 11: Hoare triple {490#true} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {490#true} is VALID [2022-04-28 01:00:18,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#true} [84] 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] {490#true} is VALID [2022-04-28 01:00:18,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#true} [87] 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[] {490#true} is VALID [2022-04-28 01:00:18,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,981 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {490#true} {490#true} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {490#true} is VALID [2022-04-28 01:00:18,981 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#true} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {490#true} is VALID [2022-04-28 01:00:18,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#true} [84] 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] {490#true} is VALID [2022-04-28 01:00:18,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#true} [87] 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[] {490#true} is VALID [2022-04-28 01:00:18,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,982 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {490#true} {490#true} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {490#true} is VALID [2022-04-28 01:00:18,982 INFO L272 TraceCheckUtils]: 21: Hoare triple {490#true} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {490#true} is VALID [2022-04-28 01:00:18,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {490#true} [84] 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] {490#true} is VALID [2022-04-28 01:00:18,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {490#true} [87] 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[] {490#true} is VALID [2022-04-28 01:00:18,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {490#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#true} is VALID [2022-04-28 01:00:18,982 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {490#true} {490#true} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {490#true} is VALID [2022-04-28 01:00:18,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {490#true} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 01:00:18,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 01:00:18,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [95] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 01:00:18,987 INFO L272 TraceCheckUtils]: 29: Hoare triple {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [98] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {583#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 01:00:18,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {583#(= |__VERIFIER_assert_#in~cond| 1)} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:00:18,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {491#false} is VALID [2022-04-28 01:00:18,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {491#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#false} is VALID [2022-04-28 01:00:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 01:00:18,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:00:18,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:00:18,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48316192] [2022-04-28 01:00:18,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:00:18,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366479018] [2022-04-28 01:00:18,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366479018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:00:18,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:00:18,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 01:00:18,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038139659] [2022-04-28 01:00:18,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:00:18,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-28 01:00:18,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:00:18,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:00:19,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:19,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:00:19,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:00:19,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:00:19,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 01:00:19,010 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:00:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:19,150 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 01:00:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:00:19,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-28 01:00:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:00:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:00:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 01:00:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:00:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 01:00:19,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 01:00:19,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:19,194 INFO L225 Difference]: With dead ends: 39 [2022-04-28 01:00:19,194 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 01:00:19,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 01:00:19,195 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:00:19,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:00:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 01:00:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 01:00:19,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:00:19,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:00:19,203 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:00:19,204 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:00:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:19,206 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 01:00:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 01:00:19,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:19,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:19,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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 36 states. [2022-04-28 01:00:19,207 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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 36 states. [2022-04-28 01:00:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:19,208 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 01:00:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 01:00:19,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:19,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:19,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:00:19,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:00:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:00:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 01:00:19,210 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2022-04-28 01:00:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:00:19,210 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 01:00:19,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:00:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 01:00:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 01:00:19,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:00:19,211 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2022-04-28 01:00:19,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 01:00:19,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 01:00:19,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:00:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:00:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1112374504, now seen corresponding path program 1 times [2022-04-28 01:00:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:00:19,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758686556] [2022-04-28 01:00:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:00:19,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:00:19,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545494666] [2022-04-28 01:00:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:19,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:00:19,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:00:19,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:00:19,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 01:00:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:19,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:00:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:00:19,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:00:19,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {782#(<= ~counter~0 0)} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {782#(<= ~counter~0 0)} {774#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {782#(<= ~counter~0 0)} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {782#(<= ~counter~0 0)} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {782#(<= ~counter~0 0)} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {782#(<= ~counter~0 0)} [84] 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] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(<= ~counter~0 0)} [87] 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[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,725 INFO L272 TraceCheckUtils]: 11: Hoare triple {782#(<= ~counter~0 0)} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(<= ~counter~0 0)} [84] 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] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#(<= ~counter~0 0)} [87] 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[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {782#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,727 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,727 INFO L272 TraceCheckUtils]: 16: Hoare triple {782#(<= ~counter~0 0)} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#(<= ~counter~0 0)} [84] 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] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(<= ~counter~0 0)} [87] 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[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {782#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,729 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,729 INFO L272 TraceCheckUtils]: 21: Hoare triple {782#(<= ~counter~0 0)} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {782#(<= ~counter~0 0)} [84] 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] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {782#(<= ~counter~0 0)} [87] 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[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,730 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {782#(<= ~counter~0 0)} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {782#(<= ~counter~0 0)} is VALID [2022-04-28 01:00:19,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {782#(<= ~counter~0 0)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {861#(<= ~counter~0 1)} [95] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,735 INFO L272 TraceCheckUtils]: 29: Hoare triple {861#(<= ~counter~0 1)} [98] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {861#(<= ~counter~0 1)} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {861#(<= ~counter~0 1)} [101] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {861#(<= ~counter~0 1)} [106] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,736 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {861#(<= ~counter~0 1)} {861#(<= ~counter~0 1)} [115] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {861#(<= ~counter~0 1)} [103] L37-1-->L42: Formula: (not (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {861#(<= ~counter~0 1)} [107] L42-->L42-2: Formula: (and (< (mod v_main_~y~0_1 4294967296) (mod v_main_~x~0_2 4294967296)) (= v_main_~v~0_1 (+ v_main_~u~0_1 v_main_~v~0_2)) (= v_main_~x~0_1 (+ (* (- 1) v_main_~y~0_1) v_main_~x~0_2))) InVars {main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_2, main_~x~0=v_main_~x~0_2, main_~u~0=v_main_~u~0_1} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~x~0=v_main_~x~0_1, main_~u~0=v_main_~u~0_1} AuxVars[] AssignedVars[main_~v~0, main_~x~0] {861#(<= ~counter~0 1)} is VALID [2022-04-28 01:00:19,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {861#(<= ~counter~0 1)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {889#(<= |main_#t~post6| 1)} is VALID [2022-04-28 01:00:19,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {889#(<= |main_#t~post6| 1)} [94] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {775#false} is VALID [2022-04-28 01:00:19,738 INFO L272 TraceCheckUtils]: 38: Hoare triple {775#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {775#false} is VALID [2022-04-28 01:00:19,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {775#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {775#false} is VALID [2022-04-28 01:00:19,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {775#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {775#false} is VALID [2022-04-28 01:00:19,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {775#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {775#false} is VALID [2022-04-28 01:00:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 01:00:19,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:00:19,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {775#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {775#false} is VALID [2022-04-28 01:00:19,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {775#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {775#false} is VALID [2022-04-28 01:00:19,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {775#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {775#false} is VALID [2022-04-28 01:00:19,914 INFO L272 TraceCheckUtils]: 38: Hoare triple {775#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {775#false} is VALID [2022-04-28 01:00:19,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {917#(< |main_#t~post6| 20)} [94] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {775#false} is VALID [2022-04-28 01:00:19,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {921#(< ~counter~0 20)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {917#(< |main_#t~post6| 20)} is VALID [2022-04-28 01:00:19,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {921#(< ~counter~0 20)} [107] L42-->L42-2: Formula: (and (< (mod v_main_~y~0_1 4294967296) (mod v_main_~x~0_2 4294967296)) (= v_main_~v~0_1 (+ v_main_~u~0_1 v_main_~v~0_2)) (= v_main_~x~0_1 (+ (* (- 1) v_main_~y~0_1) v_main_~x~0_2))) InVars {main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_2, main_~x~0=v_main_~x~0_2, main_~u~0=v_main_~u~0_1} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~x~0=v_main_~x~0_1, main_~u~0=v_main_~u~0_1} AuxVars[] AssignedVars[main_~v~0, main_~x~0] {921#(< ~counter~0 20)} is VALID [2022-04-28 01:00:19,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {921#(< ~counter~0 20)} [103] L37-1-->L42: Formula: (not (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[] {921#(< ~counter~0 20)} is VALID [2022-04-28 01:00:19,916 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {774#true} {921#(< ~counter~0 20)} [115] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {921#(< ~counter~0 20)} is VALID [2022-04-28 01:00:19,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {774#true} [106] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {774#true} [101] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {774#true} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {774#true} is VALID [2022-04-28 01:00:19,917 INFO L272 TraceCheckUtils]: 29: Hoare triple {921#(< ~counter~0 20)} [98] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {774#true} is VALID [2022-04-28 01:00:19,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {921#(< ~counter~0 20)} [95] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {921#(< ~counter~0 20)} is VALID [2022-04-28 01:00:19,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {949#(< ~counter~0 19)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {921#(< ~counter~0 20)} is VALID [2022-04-28 01:00:19,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {949#(< ~counter~0 19)} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,919 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {774#true} {949#(< ~counter~0 19)} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} [87] 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[] {774#true} is VALID [2022-04-28 01:00:19,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {774#true} [84] 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] {774#true} is VALID [2022-04-28 01:00:19,919 INFO L272 TraceCheckUtils]: 21: Hoare triple {949#(< ~counter~0 19)} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {774#true} is VALID [2022-04-28 01:00:19,920 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {774#true} {949#(< ~counter~0 19)} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {774#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} [87] 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[] {774#true} is VALID [2022-04-28 01:00:19,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {774#true} [84] 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] {774#true} is VALID [2022-04-28 01:00:19,920 INFO L272 TraceCheckUtils]: 16: Hoare triple {949#(< ~counter~0 19)} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {774#true} is VALID [2022-04-28 01:00:19,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {774#true} {949#(< ~counter~0 19)} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} [87] 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[] {774#true} is VALID [2022-04-28 01:00:19,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#true} [84] 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] {774#true} is VALID [2022-04-28 01:00:19,925 INFO L272 TraceCheckUtils]: 11: Hoare triple {949#(< ~counter~0 19)} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {774#true} is VALID [2022-04-28 01:00:19,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {949#(< ~counter~0 19)} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} [87] 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[] {774#true} is VALID [2022-04-28 01:00:19,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} [84] 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] {774#true} is VALID [2022-04-28 01:00:19,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {949#(< ~counter~0 19)} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {774#true} is VALID [2022-04-28 01:00:19,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#(< ~counter~0 19)} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {949#(< ~counter~0 19)} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {949#(< ~counter~0 19)} {774#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#(< ~counter~0 19)} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {949#(< ~counter~0 19)} is VALID [2022-04-28 01:00:19,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#true} is VALID [2022-04-28 01:00:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 01:00:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:00:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758686556] [2022-04-28 01:00:19,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:00:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545494666] [2022-04-28 01:00:19,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545494666] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:00:19,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:00:19,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 01:00:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430017943] [2022-04-28 01:00:19,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:00:19,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-28 01:00:19,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:00:19,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 01:00:19,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:19,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 01:00:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:00:19,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 01:00:19,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 01:00:19,980 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 01:00:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:20,176 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 01:00:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 01:00:20,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-28 01:00:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:00:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 01:00:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-28 01:00:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 01:00:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-28 01:00:20,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2022-04-28 01:00:20,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:00:20,233 INFO L225 Difference]: With dead ends: 69 [2022-04-28 01:00:20,233 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 01:00:20,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 01:00:20,238 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:00:20,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:00:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 01:00:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-04-28 01:00:20,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:00:20,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:00:20,267 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:00:20,268 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:00:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:20,270 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-28 01:00:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-28 01:00:20,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:20,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:20,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 01:00:20,271 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 01:00:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:00:20,272 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-28 01:00:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-28 01:00:20,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:00:20,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:00:20,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:00:20,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:00:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:00:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-28 01:00:20,275 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 42 [2022-04-28 01:00:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:00:20,278 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-28 01:00:20,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 01:00:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-28 01:00:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 01:00:20,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:00:20,287 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 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] [2022-04-28 01:00:20,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 01:00:20,507 WARN L477 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-28 01:00:20,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:00:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:00:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1113446980, now seen corresponding path program 1 times [2022-04-28 01:00:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:00:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436145413] [2022-04-28 01:00:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:00:20,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:00:20,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890829743] [2022-04-28 01:00:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:00:20,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:00:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:00:20,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:00:20,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process