/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/divbin.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:37:59,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:37:59,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:37:59,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:37:59,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:37:59,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:37:59,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:37:59,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:37:59,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:37:59,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:37:59,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:37:59,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:37:59,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:37:59,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:37:59,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:37:59,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:37:59,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:37:59,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:37:59,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:37:59,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:37:59,107 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:37:59,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:37:59,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:37:59,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:37:59,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:37:59,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:37:59,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:37:59,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:37:59,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:37:59,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:37:59,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:37:59,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:37:59,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:37:59,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:37:59,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:37:59,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:37:59,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:37:59,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:37:59,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:37:59,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:37:59,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:37:59,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:37:59,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:37:59,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:37:59,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:37:59,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:37:59,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:37:59,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:37:59,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:37:59,153 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:37:59,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:37:59,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:37:59,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:37:59,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:37:59,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:37:59,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:37:59,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:37:59,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:37:59,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:37:59,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:37:59,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:37:59,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:37:59,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:37:59,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:37:59,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:37:59,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:37:59,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:37:59,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:37:59,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:37:59,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:37:59,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:37:59,157 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:37:59,157 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-27 22:37:59,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:37:59,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:37:59,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:37:59,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:37:59,320 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:37:59,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin.i [2022-04-27 22:37:59,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea62b2ea/a68cc59dbd1e482faef73a4d26872234/FLAG1da3091be [2022-04-27 22:37:59,684 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:37:59,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin.i [2022-04-27 22:37:59,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea62b2ea/a68cc59dbd1e482faef73a4d26872234/FLAG1da3091be [2022-04-27 22:37:59,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea62b2ea/a68cc59dbd1e482faef73a4d26872234 [2022-04-27 22:37:59,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:37:59,699 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:37:59,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:37:59,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:37:59,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:37:59,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9a846d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59, skipping insertion in model container [2022-04-27 22:37:59,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:37:59,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:37:59,839 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/divbin.i[950,963] [2022-04-27 22:37:59,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:37:59,856 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:37:59,863 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/divbin.i[950,963] [2022-04-27 22:37:59,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:37:59,875 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:37:59,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59 WrapperNode [2022-04-27 22:37:59,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:37:59,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:37:59,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:37:59,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:37:59,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:37:59,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:37:59,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:37:59,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:37:59,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (1/1) ... [2022-04-27 22:37:59,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:37:59,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:37:59,928 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-27 22:37:59,938 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-27 22:37:59,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:37:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:37:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:37:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:37:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:37:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:37:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:37:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:37:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 22:37:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 22:37:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:37:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:37:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:37:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:38:00,010 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:38:00,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:38:00,120 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:38:00,125 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:38:00,125 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 22:38:00,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:00 BoogieIcfgContainer [2022-04-27 22:38:00,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:38:00,127 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:38:00,127 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:38:00,140 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:38:00,142 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:00" (1/1) ... [2022-04-27 22:38:00,143 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:38:00,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:38:00 BasicIcfg [2022-04-27 22:38:00,167 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:38:00,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:38:00,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:38:00,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:38:00,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:37:59" (1/4) ... [2022-04-27 22:38:00,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393cabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:38:00, skipping insertion in model container [2022-04-27 22:38:00,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:37:59" (2/4) ... [2022-04-27 22:38:00,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393cabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:38:00, skipping insertion in model container [2022-04-27 22:38:00,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:00" (3/4) ... [2022-04-27 22:38:00,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393cabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:38:00, skipping insertion in model container [2022-04-27 22:38:00,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:38:00" (4/4) ... [2022-04-27 22:38:00,171 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin.iqvasr [2022-04-27 22:38:00,180 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:38:00,180 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:38:00,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:38:00,212 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@6106ee22, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66b044e2 [2022-04-27 22:38:00,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:38:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:38:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 22:38:00,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:00,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:00,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 227793864, now seen corresponding path program 1 times [2022-04-27 22:38:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:00,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294952647] [2022-04-27 22:38:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:38:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:00,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 22:38:00,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 22:38:00,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 22:38:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:38:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:00,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [98] assume_abort_if_notENTRY-->L16: 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] {34#true} is VALID [2022-04-27 22:38:00,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [100] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 22:38:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 22:38:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:00,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [98] assume_abort_if_notENTRY-->L16: 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] {34#true} is VALID [2022-04-27 22:38:00,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [100] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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#false} is VALID [2022-04-27 22:38:00,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:38:00,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 22:38:00,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 22:38:00,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 22:38:00,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 22:38:00,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {34#true} is VALID [2022-04-27 22:38:00,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-27 22:38:00,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [98] assume_abort_if_notENTRY-->L16: 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] {34#true} is VALID [2022-04-27 22:38:00,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [100] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 22:38:00,435 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {34#true} is VALID [2022-04-27 22:38:00,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} [98] assume_abort_if_notENTRY-->L16: 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] {34#true} is VALID [2022-04-27 22:38:00,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} [100] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35#false} {35#false} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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#false} is VALID [2022-04-27 22:38:00,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {35#false} is VALID [2022-04-27 22:38:00,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} [102] L35-2-->L44-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#false} [106] L44-2-->L39-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,438 INFO L272 TraceCheckUtils]: 19: Hoare triple {35#false} [111] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_8 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_8, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {35#false} is VALID [2022-04-27 22:38:00,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {35#false} [114] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-27 22:38:00,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} [118] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 22:38:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:38:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:00,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294952647] [2022-04-27 22:38:00,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294952647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:38:00,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:38:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:38:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343862183] [2022-04-27 22:38:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 22:38:00,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:00,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:00,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:38:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:00,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:38:00,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:38:00,513 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:00,586 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 22:38:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:38:00,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 22:38:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-27 22:38:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-27 22:38:00,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-27 22:38:00,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:00,666 INFO L225 Difference]: With dead ends: 55 [2022-04-27 22:38:00,666 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 22:38:00,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-27 22:38:00,670 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:00,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:38:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 22:38:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 22:38:00,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:00,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:38:00,690 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:38:00,690 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:38:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:00,692 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 22:38:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 22:38:00,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:00,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:00,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 22:38:00,693 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 22:38:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:00,696 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 22:38:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 22:38:00,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:00,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:00,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:00,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:38:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-27 22:38:00,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2022-04-27 22:38:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:00,699 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-27 22:38:00,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 22:38:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 22:38:00,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:00,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:00,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:38:00,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1977749520, now seen corresponding path program 1 times [2022-04-27 22:38:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:00,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693986716] [2022-04-27 22:38:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:00,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:00,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268151161] [2022-04-27 22:38:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:00,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:00,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:00,724 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-27 22:38:00,725 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-27 22:38:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:00,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 22:38:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:00,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:01,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {211#true} is VALID [2022-04-27 22:38:01,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#true} {211#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {211#true} is VALID [2022-04-27 22:38:01,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {211#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {211#true} is VALID [2022-04-27 22:38:01,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#true} [98] assume_abort_if_notENTRY-->L16: 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] {237#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 22:38:01,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [101] L16-->L16-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[] {241#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:01,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(not (= |assume_abort_if_not_#in~cond| 0))} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:01,589 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {241#(not (= |assume_abort_if_not_#in~cond| 0))} {211#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {248#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 22:38:01,589 INFO L272 TraceCheckUtils]: 11: Hoare triple {248#(< (mod main_~B~0 4294967296) 2147483647)} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {211#true} is VALID [2022-04-27 22:38:01,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#true} [98] assume_abort_if_notENTRY-->L16: 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] {211#true} is VALID [2022-04-27 22:38:01,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {211#true} [101] L16-->L16-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[] {211#true} is VALID [2022-04-27 22:38:01,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {211#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,590 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {211#true} {248#(< (mod main_~B~0 4294967296) 2147483647)} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {248#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 22:38:01,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {248#(< (mod main_~B~0 4294967296) 2147483647)} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 22:38:01,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 22:38:01,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} [109] L36-->L44-2: Formula: (not (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 22:38:01,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 22:38:01,595 INFO L272 TraceCheckUtils]: 20: Hoare triple {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:01,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L19: 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] {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:01,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} [118] L19-->L20: 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[] {212#false} is VALID [2022-04-27 22:38:01,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {212#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#false} is VALID [2022-04-27 22:38:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:38:01,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:38:01,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {212#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#false} is VALID [2022-04-27 22:38:01,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} [118] L19-->L20: 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[] {212#false} is VALID [2022-04-27 22:38:01,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L19: 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] {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:01,921 INFO L272 TraceCheckUtils]: 20: Hoare triple {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:01,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 22:38:01,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [109] L36-->L44-2: Formula: (not (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 22:38:01,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 22:38:01,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {211#true} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 22:38:01,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {211#true} {211#true} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {211#true} is VALID [2022-04-27 22:38:01,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {211#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {211#true} [101] L16-->L16-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[] {211#true} is VALID [2022-04-27 22:38:01,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#true} [98] assume_abort_if_notENTRY-->L16: 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] {211#true} is VALID [2022-04-27 22:38:01,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {211#true} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {211#true} is VALID [2022-04-27 22:38:01,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {211#true} {211#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {211#true} is VALID [2022-04-27 22:38:01,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#true} [101] L16-->L16-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[] {211#true} is VALID [2022-04-27 22:38:01,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#true} [98] assume_abort_if_notENTRY-->L16: 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] {211#true} is VALID [2022-04-27 22:38:01,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {211#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {211#true} is VALID [2022-04-27 22:38:01,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {211#true} is VALID [2022-04-27 22:38:01,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#true} {211#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {211#true} is VALID [2022-04-27 22:38:01,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#true} is VALID [2022-04-27 22:38:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:38:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:01,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693986716] [2022-04-27 22:38:01,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:01,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268151161] [2022-04-27 22:38:01,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268151161] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:38:01,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:38:01,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 22:38:01,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760224402] [2022-04-27 22:38:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 22:38:01,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:01,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:01,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:01,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:38:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:38:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:38:01,957 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:04,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 22:38:06,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 22:38:08,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 22:38:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:08,311 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-27 22:38:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:38:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 22:38:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 22:38:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 22:38:08,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-27 22:38:08,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:08,357 INFO L225 Difference]: With dead ends: 38 [2022-04-27 22:38:08,357 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 22:38:08,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:38:08,358 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:08,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-27 22:38:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 22:38:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 22:38:08,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:08,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:08,363 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:08,363 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:08,364 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 22:38:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 22:38:08,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:08,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:08,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 22:38:08,365 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 22:38:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:08,367 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 22:38:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 22:38:08,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:08,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:08,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:08,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-04-27 22:38:08,369 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2022-04-27 22:38:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:08,369 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-04-27 22:38:08,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 22:38:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 22:38:08,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:08,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:08,389 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-27 22:38:08,575 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-27 22:38:08,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:08,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:08,576 INFO L85 PathProgramCache]: Analyzing trace with hash 154407786, now seen corresponding path program 1 times [2022-04-27 22:38:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:08,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210132820] [2022-04-27 22:38:08,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:08,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:08,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112068303] [2022-04-27 22:38:08,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:08,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:08,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:08,595 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-27 22:38:08,600 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-27 22:38:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:08,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 22:38:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:08,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:09,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {539#true} is VALID [2022-04-27 22:38:09,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {539#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#true} [98] assume_abort_if_notENTRY-->L16: 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] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#true} [101] L16-->L16-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[] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {539#true} {539#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {539#true} is VALID [2022-04-27 22:38:09,156 INFO L272 TraceCheckUtils]: 11: Hoare triple {539#true} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {539#true} is VALID [2022-04-27 22:38:09,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#true} [98] assume_abort_if_notENTRY-->L16: 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] {580#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 22:38:09,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [101] L16-->L16-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[] {584#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:09,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {584#(not (= |assume_abort_if_not_#in~cond| 0))} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:09,161 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {584#(not (= |assume_abort_if_not_#in~cond| 0))} {539#true} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {591#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 22:38:09,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {591#(<= 1 (mod main_~B~0 4294967296))} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 22:38:09,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 22:38:09,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} [110] L36-->L35-2: Formula: (and (<= (mod v_main_~b~0_2 4294967296) (mod v_main_~r~0_1 4294967296)) (= v_main_~b~0_1 (* v_main_~b~0_2 2))) InVars {main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~b~0] {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:09,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:09,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [109] L36-->L44-2: Formula: (not (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:09,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:09,165 INFO L272 TraceCheckUtils]: 22: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:09,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L19: 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] {619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:09,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {619#(<= 1 __VERIFIER_assert_~cond)} [118] L19-->L20: 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[] {540#false} is VALID [2022-04-27 22:38:09,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {540#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {540#false} is VALID [2022-04-27 22:38:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:38:09,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:38:09,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {540#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {540#false} is VALID [2022-04-27 22:38:09,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {619#(<= 1 __VERIFIER_assert_~cond)} [118] L19-->L20: 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[] {540#false} is VALID [2022-04-27 22:38:09,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L19: 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] {619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:09,592 INFO L272 TraceCheckUtils]: 22: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:09,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 22:38:09,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [109] L36-->L44-2: Formula: (not (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 22:38:09,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 22:38:09,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [110] L36-->L35-2: Formula: (and (<= (mod v_main_~b~0_2 4294967296) (mod v_main_~r~0_1 4294967296)) (= v_main_~b~0_1 (* v_main_~b~0_2 2))) InVars {main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~b~0] {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 22:38:09,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 22:38:09,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#true} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 22:38:09,595 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {539#true} {539#true} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {539#true} is VALID [2022-04-27 22:38:09,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#true} [101] L16-->L16-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[] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#true} [98] assume_abort_if_notENTRY-->L16: 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] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {539#true} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {539#true} {539#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#true} [101] L16-->L16-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[] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#true} [98] assume_abort_if_notENTRY-->L16: 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] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {539#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {539#true} is VALID [2022-04-27 22:38:09,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {539#true} is VALID [2022-04-27 22:38:09,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-27 22:38:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:38:09,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:09,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210132820] [2022-04-27 22:38:09,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:09,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112068303] [2022-04-27 22:38:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112068303] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:38:09,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:38:09,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 22:38:09,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291689951] [2022-04-27 22:38:09,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:09,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 22:38:09,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:09,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:11,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:11,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:38:11,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:11,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:38:11,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:38:11,640 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:11,772 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 22:38:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:38:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 22:38:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:38:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:38:11,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 22:38:13,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:13,500 INFO L225 Difference]: With dead ends: 43 [2022-04-27 22:38:13,500 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 22:38:13,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:38:13,501 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:13,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-04-27 22:38:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 22:38:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 22:38:13,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:13,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:38:13,511 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:38:13,511 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:38:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:13,512 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 22:38:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 22:38:13,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:13,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:13,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-27 22:38:13,513 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-27 22:38:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:13,515 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 22:38:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 22:38:13,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:13,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:13,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:13,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:38:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-27 22:38:13,519 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 26 [2022-04-27 22:38:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:13,519 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-27 22:38:13,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 22:38:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 22:38:13,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:13,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:13,537 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-27 22:38:13,720 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-27 22:38:13,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1097850398, now seen corresponding path program 1 times [2022-04-27 22:38:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:13,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103793242] [2022-04-27 22:38:13,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:13,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:13,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178643296] [2022-04-27 22:38:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:13,735 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-27 22:38:13,736 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-27 22:38:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:13,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 22:38:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:13,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:13,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {905#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#true} is VALID [2022-04-27 22:38:13,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {905#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {905#true} is VALID [2022-04-27 22:38:13,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#true} is VALID [2022-04-27 22:38:13,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#true} is VALID [2022-04-27 22:38:13,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {905#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#true} is VALID [2022-04-27 22:38:13,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {905#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {905#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#true} [98] assume_abort_if_notENTRY-->L16: 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] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {905#true} [101] L16-->L16-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[] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {905#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {905#true} {905#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {905#true} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#true} [98] assume_abort_if_notENTRY-->L16: 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] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#true} [101] L16-->L16-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[] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#true} is VALID [2022-04-27 22:38:13,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {905#true} {905#true} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {905#true} is VALID [2022-04-27 22:38:13,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#true} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {958#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 22:38:13,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {958#(= main_~B~0 main_~b~0)} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {958#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 22:38:13,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {958#(= main_~B~0 main_~b~0)} [109] L36-->L44-2: Formula: (not (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {958#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 22:38:13,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {958#(= main_~B~0 main_~b~0)} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {958#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 22:38:13,847 INFO L272 TraceCheckUtils]: 20: Hoare triple {958#(= main_~B~0 main_~b~0)} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {905#true} is VALID [2022-04-27 22:38:13,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {905#true} [114] __VERIFIER_assertENTRY-->L19: 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] {905#true} is VALID [2022-04-27 22:38:13,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {905#true} [119] L19-->L19-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[] {905#true} is VALID [2022-04-27 22:38:13,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {905#true} [124] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#true} is VALID [2022-04-27 22:38:13,848 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {905#true} {958#(= main_~B~0 main_~b~0)} [129] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {958#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 22:38:13,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {958#(= main_~B~0 main_~b~0)} [116] L40-1-->L44: Formula: (let ((.cse0 (mod v_main_~b~0_7 4294967296))) (and (= v_main_~q~0_3 (* v_main_~q~0_4 2)) (not (= (mod v_main_~B~0_7 4294967296) .cse0)) (= v_main_~b~0_6 (div .cse0 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {906#false} is VALID [2022-04-27 22:38:13,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {906#false} [120] L44-->L44-2: Formula: (and (<= (mod v_main_~b~0_9 4294967296) (mod v_main_~r~0_6 4294967296)) (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_5 (+ (* (- 1) v_main_~b~0_9) v_main_~r~0_6))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_9, main_~r~0=v_main_~r~0_6} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_9, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {906#false} is VALID [2022-04-27 22:38:13,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {906#false} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {906#false} is VALID [2022-04-27 22:38:13,848 INFO L272 TraceCheckUtils]: 28: Hoare triple {906#false} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {906#false} is VALID [2022-04-27 22:38:13,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {906#false} [114] __VERIFIER_assertENTRY-->L19: 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] {906#false} is VALID [2022-04-27 22:38:13,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {906#false} [118] L19-->L20: 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[] {906#false} is VALID [2022-04-27 22:38:13,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {906#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {906#false} is VALID [2022-04-27 22:38:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:38:13,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:38:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:13,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103793242] [2022-04-27 22:38:13,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:13,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178643296] [2022-04-27 22:38:13,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178643296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:38:13,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:38:13,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:38:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595231841] [2022-04-27 22:38:13,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-27 22:38:13,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:13,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:13,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:13,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:38:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:38:13,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:38:13,876 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:13,932 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 22:38:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:38:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-27 22:38:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 22:38:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 22:38:13,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 22:38:13,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:13,975 INFO L225 Difference]: With dead ends: 52 [2022-04-27 22:38:13,975 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 22:38:13,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-27 22:38:13,976 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:13,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:38:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 22:38:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 22:38:13,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:13,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:13,982 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:13,982 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:13,983 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 22:38:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 22:38:13,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:13,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:13,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 22:38:13,984 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 22:38:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:13,985 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 22:38:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 22:38:13,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:13,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:13,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:13,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 22:38:13,987 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 32 [2022-04-27 22:38:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:13,987 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 22:38:13,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 22:38:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 22:38:13,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:13,993 INFO L195 NwaCegarLoop]: trace histogram [2, 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-27 22:38:14,011 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-27 22:38:14,194 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-27 22:38:14,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 71689796, now seen corresponding path program 1 times [2022-04-27 22:38:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:14,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374484292] [2022-04-27 22:38:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:14,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:14,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645215856] [2022-04-27 22:38:14,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:14,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:14,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:14,206 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-27 22:38:14,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 22:38:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:14,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 22:38:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:14,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:14,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {1190#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {1190#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1190#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1190#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {1190#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1190#true} [98] assume_abort_if_notENTRY-->L16: 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] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {1190#true} [101] L16-->L16-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[] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {1190#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1190#true} {1190#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L272 TraceCheckUtils]: 11: Hoare triple {1190#true} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {1190#true} [98] assume_abort_if_notENTRY-->L16: 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] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {1190#true} [101] L16-->L16-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[] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {1190#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1190#true} {1190#true} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {1190#true} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {1190#true} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {1190#true} [110] L36-->L35-2: Formula: (and (<= (mod v_main_~b~0_2 4294967296) (mod v_main_~r~0_1 4294967296)) (= v_main_~b~0_1 (* v_main_~b~0_2 2))) InVars {main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~b~0] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {1190#true} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {1190#true} [109] L36-->L44-2: Formula: (not (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {1190#true} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:14,419 INFO L272 TraceCheckUtils]: 22: Hoare triple {1190#true} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1190#true} is VALID [2022-04-27 22:38:14,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {1190#true} [114] __VERIFIER_assertENTRY-->L19: 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] {1264#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:14,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {1264#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [119] L19-->L19-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[] {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:38:14,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:38:14,423 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} {1190#true} [129] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 22:38:14,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [115] L40-1-->L39-1: Formula: (= (mod v_main_~b~0_5 4294967296) (mod v_main_~B~0_4 4294967296)) InVars {main_~b~0=v_main_~b~0_5, main_~B~0=v_main_~B~0_4} OutVars{main_~b~0=v_main_~b~0_5, main_~B~0=v_main_~B~0_4} AuxVars[] AssignedVars[] {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 22:38:14,424 INFO L272 TraceCheckUtils]: 28: Hoare triple {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [111] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_8 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_8, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1282#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 22:38:14,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {1282#(= |__VERIFIER_assert_#in~cond| 1)} [114] __VERIFIER_assertENTRY-->L19: 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] {1286#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 22:38:14,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {1286#(= __VERIFIER_assert_~cond 1)} [118] L19-->L20: 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[] {1191#false} is VALID [2022-04-27 22:38:14,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {1191#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-27 22:38:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 22:38:14,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:38:15,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {1191#false} [122] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-27 22:38:15,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {1296#(not (= __VERIFIER_assert_~cond 0))} [118] L19-->L20: 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[] {1191#false} is VALID [2022-04-27 22:38:15,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} [114] __VERIFIER_assertENTRY-->L19: 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] {1296#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:38:15,188 INFO L272 TraceCheckUtils]: 28: Hoare triple {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [111] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_8 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_8, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:38:15,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [115] L40-1-->L39-1: Formula: (= (mod v_main_~b~0_5 4294967296) (mod v_main_~B~0_4 4294967296)) InVars {main_~b~0=v_main_~b~0_5, main_~B~0=v_main_~B~0_4} OutVars{main_~b~0=v_main_~b~0_5, main_~B~0=v_main_~B~0_4} AuxVars[] AssignedVars[] {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 22:38:15,189 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} {1190#true} [129] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1275#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 22:38:15,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:38:15,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {1318#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [119] L19-->L19-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[] {1268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {1190#true} [114] __VERIFIER_assertENTRY-->L19: 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] {1318#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:38:15,190 INFO L272 TraceCheckUtils]: 22: Hoare triple {1190#true} [112] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_7 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {1190#true} [108] L44-2-->L40: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {1190#true} [109] L36-->L44-2: Formula: (not (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {1190#true} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {1190#true} [110] L36-->L35-2: Formula: (and (<= (mod v_main_~b~0_2 4294967296) (mod v_main_~r~0_1 4294967296)) (= v_main_~b~0_1 (* v_main_~b~0_2 2))) InVars {main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~b~0] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {1190#true} [104] L35-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {1190#true} [99] L31-->L35-2: Formula: (and (= v_main_~B~0_8 v_main_~b~0_8) (= v_main_~q~0_5 0) (= v_main_~A~0_5 v_main_~r~0_4)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_8, main_~A~0=v_main_~A~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1190#true} {1190#true} [127] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {1190#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {1190#true} [101] L16-->L16-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[] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {1190#true} [98] assume_abort_if_notENTRY-->L16: 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] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L272 TraceCheckUtils]: 11: Hoare triple {1190#true} [97] L30-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_10} 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] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1190#true} {1190#true} [126] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {1190#true} [105] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {1190#true} [101] L16-->L16-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[] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {1190#true} [98] assume_abort_if_notENTRY-->L16: 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] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {1190#true} [96] L30-->assume_abort_if_notENTRY: Formula: (= (ite (< (mod v_main_~B~0_9 4294967296) 2147483647) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {1190#true} [94] mainENTRY-->L30: Formula: (and (= v_main_~B~0_1 |v_main_#t~nondet2_2|) (= v_main_~A~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_#t~nondet2, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {1190#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1190#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1190#true} is VALID [2022-04-27 22:38:15,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {1190#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-27 22:38:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 22:38:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374484292] [2022-04-27 22:38:15,192 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645215856] [2022-04-27 22:38:15,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645215856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:38:15,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:38:15,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 22:38:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512764271] [2022-04-27 22:38:15,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 22:38:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-27 22:38:15,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:15,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 22:38:15,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:15,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 22:38:15,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:15,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 22:38:15,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:38:15,218 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 22:38:17,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 22:38:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:17,635 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 22:38:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:38:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-27 22:38:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 22:38:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-27 22:38:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 22:38:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-27 22:38:17,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-27 22:38:17,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:17,664 INFO L225 Difference]: With dead ends: 40 [2022-04-27 22:38:17,664 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 22:38:17,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:38:17,664 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:17,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 165 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 22:38:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 22:38:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 22:38:17,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:17,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:17,670 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:17,670 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:17,671 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 22:38:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 22:38:17,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:17,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:17,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 22:38:17,672 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 22:38:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:17,673 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 22:38:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 22:38:17,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:17,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:17,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:17,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:38:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 22:38:17,674 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 32 [2022-04-27 22:38:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:17,674 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 22:38:17,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 22:38:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 22:38:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 22:38:17,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:17,675 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:17,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 22:38:17,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:17,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1313859480, now seen corresponding path program 1 times [2022-04-27 22:38:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:17,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971168751] [2022-04-27 22:38:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:17,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:17,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991835917] [2022-04-27 22:38:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:17,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:17,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:17,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:38:17,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process