/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 02:12:09,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 02:12:09,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 02:12:09,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 02:12:09,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 02:12:09,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 02:12:09,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 02:12:09,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 02:12:09,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 02:12:09,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 02:12:09,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 02:12:09,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 02:12:09,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 02:12:09,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 02:12:09,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 02:12:09,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 02:12:09,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 02:12:09,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 02:12:09,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 02:12:09,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 02:12:09,062 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 02:12:09,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 02:12:09,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 02:12:09,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 02:12:09,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 02:12:09,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 02:12:09,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 02:12:09,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 02:12:09,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 02:12:09,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 02:12:09,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 02:12:09,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 02:12:09,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 02:12:09,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 02:12:09,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 02:12:09,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 02:12:09,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 02:12:09,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 02:12:09,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 02:12:09,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 02:12:09,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 02:12:09,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 02:12:09,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 02:12:09,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 02:12:09,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 02:12:09,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 02:12:09,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 02:12:09,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 02:12:09,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 02:12:09,099 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 02:12:09,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 02:12:09,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 02:12:09,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 02:12:09,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 02:12:09,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 02:12:09,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 02:12:09,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 02:12:09,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 02:12:09,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 02:12:09,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 02:12:09,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 02:12:09,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 02:12:09,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:12:09,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 02:12:09,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 02:12:09,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 02:12:09,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 02:12:09,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 02:12:09,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 02:12:09,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 02:12:09,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 02:12:09,104 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 02:12:09,104 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 02:12:09,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 02:12:09,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 02:12:09,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 02:12:09,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 02:12:09,390 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 02:12:09,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-15 02:12:09,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420622d5b/73cc160e89234f34933a7cdfbe5918cf/FLAG25d2cd42a [2022-04-15 02:12:09,760 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 02:12:09,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-15 02:12:09,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420622d5b/73cc160e89234f34933a7cdfbe5918cf/FLAG25d2cd42a [2022-04-15 02:12:10,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420622d5b/73cc160e89234f34933a7cdfbe5918cf [2022-04-15 02:12:10,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 02:12:10,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 02:12:10,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 02:12:10,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 02:12:10,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 02:12:10,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799e89fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10, skipping insertion in model container [2022-04-15 02:12:10,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 02:12:10,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 02:12:10,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i[951,964] [2022-04-15 02:12:10,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:12:10,415 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 02:12:10,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i[951,964] [2022-04-15 02:12:10,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:12:10,458 INFO L208 MainTranslator]: Completed translation [2022-04-15 02:12:10,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10 WrapperNode [2022-04-15 02:12:10,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 02:12:10,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 02:12:10,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 02:12:10,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 02:12:10,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 02:12:10,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 02:12:10,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 02:12:10,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 02:12:10,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:12:10,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:12:10,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 02:12:10,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 02:12:10,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 02:12:10,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 02:12:10,576 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 02:12:10,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 02:12:10,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 02:12:10,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 02:12:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 02:12:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 02:12:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 02:12:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 02:12:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 02:12:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 02:12:10,640 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 02:12:10,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 02:12:10,769 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 02:12:10,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 02:12:10,774 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 02:12:10,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:12:10 BoogieIcfgContainer [2022-04-15 02:12:10,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 02:12:10,776 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 02:12:10,776 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 02:12:10,777 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 02:12:10,779 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:12:10" (1/1) ... [2022-04-15 02:12:10,780 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 02:12:10,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:12:10 BasicIcfg [2022-04-15 02:12:10,800 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 02:12:10,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 02:12:10,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 02:12:10,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 02:12:10,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:12:10" (1/4) ... [2022-04-15 02:12:10,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ba79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:12:10, skipping insertion in model container [2022-04-15 02:12:10,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:10" (2/4) ... [2022-04-15 02:12:10,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ba79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:12:10, skipping insertion in model container [2022-04-15 02:12:10,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:12:10" (3/4) ... [2022-04-15 02:12:10,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ba79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:12:10, skipping insertion in model container [2022-04-15 02:12:10,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:12:10" (4/4) ... [2022-04-15 02:12:10,806 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound1.iqvasr [2022-04-15 02:12:10,809 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 02:12:10,810 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 02:12:10,850 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 02:12:10,859 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 02:12:10,860 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 02:12:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:12:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 02:12:10,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:12:10,885 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:10,886 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:12:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:12:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2097950667, now seen corresponding path program 1 times [2022-04-15 02:12:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:12:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063793378] [2022-04-15 02:12:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:12:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:11,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:12:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:11,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-15 02:12:11,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 02:12:11,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 02:12:11,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:12:11,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-15 02:12:11,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 02:12:11,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 02:12:11,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 02:12:11,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {29#true} is VALID [2022-04-15 02:12:11,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [91] L34-3-->L43-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 02:12:11,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} [93] L43-2-->L38-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 02:12:11,083 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {30#false} is VALID [2022-04-15 02:12:11,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [103] __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] {30#false} is VALID [2022-04-15 02:12:11,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [106] 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[] {30#false} is VALID [2022-04-15 02:12:11,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 02:12:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:12:11,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:12:11,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063793378] [2022-04-15 02:12:11,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063793378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:12:11,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:12:11,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:12:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515822251] [2022-04-15 02:12:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:12:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 02:12:11,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:12:11,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:11,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:12:11,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:12:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:12:11,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:12:11,146 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:11,264 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-15 02:12:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:12:11,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 02:12:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:12:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 02:12:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 02:12:11,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 02:12:11,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:11,362 INFO L225 Difference]: With dead ends: 44 [2022-04-15 02:12:11,363 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 02:12:11,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:12:11,368 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:12:11,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:12:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 02:12:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 02:12:11,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:12:11,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,397 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,398 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:11,402 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 02:12:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 02:12:11,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:11,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:11,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 02:12:11,403 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 02:12:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:11,406 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 02:12:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 02:12:11,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:11,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:11,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:12:11,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:12:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 02:12:11,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-15 02:12:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:12:11,417 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 02:12:11,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 02:12:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 02:12:11,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:12:11,418 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:11,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 02:12:11,419 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:12:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:12:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 923003056, now seen corresponding path program 1 times [2022-04-15 02:12:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:12:11,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265579624] [2022-04-15 02:12:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:12:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:12:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:11,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(<= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:12:11,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#(<= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#(<= ~counter~0 0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#(<= ~counter~0 0)} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {171#(<= ~counter~0 0)} is VALID [2022-04-15 02:12:11,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(<= ~counter~0 0)} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {172#(<= |main_#t~post2| 0)} is VALID [2022-04-15 02:12:11,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(<= |main_#t~post2| 0)} [95] L34-1-->L43-2: Formula: (not (< |v_main_#t~post2_3| 1)) InVars {main_#t~post2=|v_main_#t~post2_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {167#false} is VALID [2022-04-15 02:12:11,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#false} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {167#false} is VALID [2022-04-15 02:12:11,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#false} [98] L38-->L38-2: Formula: (not (< |v_main_#t~post3_3| 1)) InVars {main_#t~post3=|v_main_#t~post3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {167#false} is VALID [2022-04-15 02:12:11,518 INFO L272 TraceCheckUtils]: 10: Hoare triple {167#false} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {167#false} is VALID [2022-04-15 02:12:11,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} [103] __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] {167#false} is VALID [2022-04-15 02:12:11,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} [106] 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[] {167#false} is VALID [2022-04-15 02:12:11,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-15 02:12:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:12:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:12:11,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265579624] [2022-04-15 02:12:11,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265579624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:12:11,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:12:11,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 02:12:11,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219966113] [2022-04-15 02:12:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:12:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 02:12:11,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:12:11,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:11,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:12:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:12:11,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:12:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:12:11,535 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:11,657 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 02:12:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 02:12:11,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 02:12:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:12:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 02:12:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 02:12:11,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 02:12:11,692 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-15 02:12:11,693 INFO L225 Difference]: With dead ends: 35 [2022-04-15 02:12:11,693 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 02:12:11,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:12:11,695 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:12:11,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:12:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 02:12:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 02:12:11,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:12:11,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,700 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,700 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:11,701 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 02:12:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 02:12:11,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:11,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:11,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 02:12:11,702 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 02:12:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:11,703 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 02:12:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 02:12:11,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:11,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:11,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:12:11,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:12:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 02:12:11,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-15 02:12:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:12:11,705 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 02:12:11,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 02:12:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 02:12:11,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:12:11,706 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:11,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 02:12:11,706 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:12:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:12:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1207414063, now seen corresponding path program 1 times [2022-04-15 02:12:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:12:11,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057261444] [2022-04-15 02:12:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:12:11,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:12:11,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086876959] [2022-04-15 02:12:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:11,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:11,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:12:11,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:12:11,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 02:12:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:11,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 02:12:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:11,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:12:12,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {303#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#true} is VALID [2022-04-15 02:12:12,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#true} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {303#true} is VALID [2022-04-15 02:12:12,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#true} is VALID [2022-04-15 02:12:12,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#true} is VALID [2022-04-15 02:12:12,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {303#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#true} is VALID [2022-04-15 02:12:12,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {303#true} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:12,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:12,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:12,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [100] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:12,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:12,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [98] L38-->L38-2: Formula: (not (< |v_main_#t~post3_3| 1)) InVars {main_#t~post3=|v_main_#t~post3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:12,141 INFO L272 TraceCheckUtils]: 11: Hoare triple {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:12:12,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:12:12,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {304#false} is VALID [2022-04-15 02:12:12,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {304#false} is VALID [2022-04-15 02:12:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:12:12,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:12:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:12:12,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057261444] [2022-04-15 02:12:12,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:12:12,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086876959] [2022-04-15 02:12:12,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086876959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:12:12,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:12:12,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 02:12:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880479174] [2022-04-15 02:12:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:12:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 02:12:12,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:12:12,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:12,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:12,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 02:12:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:12:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 02:12:12,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:12:12,157 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:12,273 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 02:12:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 02:12:12,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 02:12:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:12:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 02:12:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 02:12:12,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 02:12:12,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:12,314 INFO L225 Difference]: With dead ends: 35 [2022-04-15 02:12:12,314 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 02:12:12,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 02:12:12,316 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:12:12,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:12:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 02:12:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 02:12:12,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:12:12,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:12,323 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:12,323 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:12,324 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 02:12:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 02:12:12,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:12,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:12,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 02:12:12,325 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 02:12:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:12,326 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 02:12:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 02:12:12,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:12,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:12,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:12:12,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:12:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 02:12:12,328 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-15 02:12:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:12:12,328 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 02:12:12,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 02:12:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 02:12:12,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:12:12,329 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:12,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 02:12:12,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:12,546 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:12:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:12:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1227316531, now seen corresponding path program 1 times [2022-04-15 02:12:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:12:12,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735875630] [2022-04-15 02:12:12,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:12:12,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:12:12,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255603898] [2022-04-15 02:12:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:12,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:12,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:12:12,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:12:12,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 02:12:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:12,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 02:12:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:12,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:12:13,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#true} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {509#true} is VALID [2022-04-15 02:12:13,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#true} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [101] L35-->L34-3: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [95] L34-1-->L43-2: Formula: (not (< |v_main_#t~post2_3| 1)) InVars {main_#t~post2=|v_main_#t~post2_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [98] L38-->L38-2: Formula: (not (< |v_main_#t~post3_3| 1)) InVars {main_#t~post3=|v_main_#t~post3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:12:13,040 INFO L272 TraceCheckUtils]: 13: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:12:13,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:12:13,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {510#false} is VALID [2022-04-15 02:12:13,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {510#false} is VALID [2022-04-15 02:12:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:12:13,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:12:13,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {510#false} is VALID [2022-04-15 02:12:13,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {510#false} is VALID [2022-04-15 02:12:13,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:12:13,683 INFO L272 TraceCheckUtils]: 13: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:12:13,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [98] L38-->L38-2: Formula: (not (< |v_main_#t~post3_3| 1)) InVars {main_#t~post3=|v_main_#t~post3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {575#(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-15 02:12:13,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {575#(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-15 02:12:13,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [95] L34-1-->L43-2: Formula: (not (< |v_main_#t~post2_3| 1)) InVars {main_#t~post2=|v_main_#t~post2_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {575#(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-15 02:12:13,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {575#(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-15 02:12:13,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(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))))} [101] L35-->L34-3: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {575#(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-15 02:12:13,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(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))))} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {591#(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-15 02:12:13,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#(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))))} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {591#(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-15 02:12:13,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#true} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {591#(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-15 02:12:13,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#true} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {509#true} is VALID [2022-04-15 02:12:13,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-15 02:12:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:12:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:12:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735875630] [2022-04-15 02:12:13,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:12:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255603898] [2022-04-15 02:12:13,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255603898] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 02:12:13,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 02:12:13,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-15 02:12:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927696485] [2022-04-15 02:12:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:12:13,692 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 02:12:13,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:12:13,692 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:15,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:15,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 02:12:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:12:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 02:12:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 02:12:15,801 INFO L87 Difference]: Start difference. First operand 32 states and 38 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:16,003 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-15 02:12:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 02:12:16,003 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 02:12:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:12:16,004 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 02:12:16,005 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 02:12:16,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 02:12:18,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:18,064 INFO L225 Difference]: With dead ends: 43 [2022-04-15 02:12:18,064 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 02:12:18,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:12:18,065 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:12:18,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-04-15 02:12:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 02:12:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 02:12:18,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:12:18,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:12:18,079 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:12:18,079 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:12:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:18,080 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 02:12:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 02:12:18,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:18,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:18,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-15 02:12:18,081 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-15 02:12:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:18,083 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 02:12:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 02:12:18,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:18,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:18,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:12:18,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:12:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:12:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-15 02:12:18,085 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 17 [2022-04-15 02:12:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:12:18,085 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-15 02:12:18,085 INFO L479 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-15 02:12:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 02:12:18,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:12:18,086 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:18,108 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-15 02:12:18,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 02:12:18,298 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:12:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:12:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1228448589, now seen corresponding path program 1 times [2022-04-15 02:12:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:12:18,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606847013] [2022-04-15 02:12:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:12:18,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:12:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777435576] [2022-04-15 02:12:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:18,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:12:18,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:12:18,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 02:12:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:18,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 02:12:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:18,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:12:18,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {796#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {796#true} is VALID [2022-04-15 02:12:18,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#true} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {796#true} is VALID [2022-04-15 02:12:18,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {796#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {796#true} is VALID [2022-04-15 02:12:18,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {796#true} is VALID [2022-04-15 02:12:18,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {796#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {796#true} is VALID [2022-04-15 02:12:18,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {796#true} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {796#true} is VALID [2022-04-15 02:12:18,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {796#true} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {796#true} is VALID [2022-04-15 02:12:18,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#true} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {796#true} is VALID [2022-04-15 02:12:18,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#true} [101] L35-->L34-3: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {796#true} is VALID [2022-04-15 02:12:18,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {796#true} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {828#(<= (+ |main_#t~post2| 1) ~counter~0)} is VALID [2022-04-15 02:12:18,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {828#(<= (+ |main_#t~post2| 1) ~counter~0)} [95] L34-1-->L43-2: Formula: (not (< |v_main_#t~post2_3| 1)) InVars {main_#t~post2=|v_main_#t~post2_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {832#(<= 2 ~counter~0)} is VALID [2022-04-15 02:12:18,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#(<= 2 ~counter~0)} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {836#(<= 2 |main_#t~post3|)} is VALID [2022-04-15 02:12:18,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {836#(<= 2 |main_#t~post3|)} [99] L38-->L39: Formula: (< |v_main_#t~post3_5| 1) InVars {main_#t~post3=|v_main_#t~post3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {797#false} is VALID [2022-04-15 02:12:18,418 INFO L272 TraceCheckUtils]: 13: Hoare triple {797#false} [104] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {797#false} is VALID [2022-04-15 02:12:18,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {797#false} [103] __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] {797#false} is VALID [2022-04-15 02:12:18,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {797#false} [106] 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[] {797#false} is VALID [2022-04-15 02:12:18,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {797#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {797#false} is VALID [2022-04-15 02:12:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 02:12:18,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:12:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:12:18,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606847013] [2022-04-15 02:12:18,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:12:18,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777435576] [2022-04-15 02:12:18,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777435576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:12:18,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:12:18,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:12:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510318134] [2022-04-15 02:12:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:12:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 02:12:18,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:12:18,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:18,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:18,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:12:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:12:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:12:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:12:18,434 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:18,529 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-04-15 02:12:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:12:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 02:12:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:12:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 02:12:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 02:12:18,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-15 02:12:18,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:18,562 INFO L225 Difference]: With dead ends: 48 [2022-04-15 02:12:18,562 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 02:12:18,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:12:18,563 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:12:18,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:12:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 02:12:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 02:12:18,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:12:18,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:18,571 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:18,571 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:18,572 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 02:12:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 02:12:18,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:18,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:18,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 02:12:18,573 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 02:12:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:18,574 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 02:12:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 02:12:18,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:18,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:18,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:12:18,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:12:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-15 02:12:18,575 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-15 02:12:18,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:12:18,576 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-15 02:12:18,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 02:12:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 02:12:18,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:12:18,576 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:18,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 02:12:18,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:18,792 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:12:18,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:12:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2051197196, now seen corresponding path program 1 times [2022-04-15 02:12:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:12:18,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252355189] [2022-04-15 02:12:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:12:18,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:12:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228412354] [2022-04-15 02:12:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:12:18,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:12:18,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 02:12:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:18,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 02:12:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:18,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:12:19,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {1023#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1023#true} is VALID [2022-04-15 02:12:19,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#true} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1031#(<= 0 ~counter~0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1031#(<= 0 ~counter~0)} {1023#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {1031#(<= 0 ~counter~0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#(<= 0 ~counter~0)} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(<= 0 ~counter~0)} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {1047#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:19,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {1047#(<= 1 ~counter~0)} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {1047#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:19,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#(<= 1 ~counter~0)} [101] L35-->L34-3: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {1047#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:19,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#(<= 1 ~counter~0)} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {1057#(<= 1 |main_#t~post2|)} is VALID [2022-04-15 02:12:19,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {1057#(<= 1 |main_#t~post2|)} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {1024#false} is VALID [2022-04-15 02:12:19,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#false} [100] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1024#false} is VALID [2022-04-15 02:12:19,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#false} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {1024#false} is VALID [2022-04-15 02:12:19,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#false} [98] L38-->L38-2: Formula: (not (< |v_main_#t~post3_3| 1)) InVars {main_#t~post3=|v_main_#t~post3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {1024#false} is VALID [2022-04-15 02:12:19,165 INFO L272 TraceCheckUtils]: 14: Hoare triple {1024#false} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {1024#false} is VALID [2022-04-15 02:12:19,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#false} [103] __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] {1024#false} is VALID [2022-04-15 02:12:19,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#false} [106] 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[] {1024#false} is VALID [2022-04-15 02:12:19,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {1024#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#false} is VALID [2022-04-15 02:12:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:12:19,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:12:19,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1024#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#false} is VALID [2022-04-15 02:12:19,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#false} [106] 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[] {1024#false} is VALID [2022-04-15 02:12:19,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#false} [103] __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] {1024#false} is VALID [2022-04-15 02:12:19,267 INFO L272 TraceCheckUtils]: 14: Hoare triple {1024#false} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {1024#false} is VALID [2022-04-15 02:12:19,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#false} [98] L38-->L38-2: Formula: (not (< |v_main_#t~post3_3| 1)) InVars {main_#t~post3=|v_main_#t~post3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {1024#false} is VALID [2022-04-15 02:12:19,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#false} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {1024#false} is VALID [2022-04-15 02:12:19,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#false} [100] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1024#false} is VALID [2022-04-15 02:12:19,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1057#(<= 1 |main_#t~post2|)} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {1024#false} is VALID [2022-04-15 02:12:19,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#(<= 1 ~counter~0)} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {1057#(<= 1 |main_#t~post2|)} is VALID [2022-04-15 02:12:19,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#(<= 1 ~counter~0)} [101] L35-->L34-3: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {1047#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:19,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {1047#(<= 1 ~counter~0)} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {1047#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:19,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(<= 0 ~counter~0)} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {1047#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:19,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#(<= 0 ~counter~0)} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {1031#(<= 0 ~counter~0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1031#(<= 0 ~counter~0)} {1023#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1031#(<= 0 ~counter~0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#true} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1031#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:19,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {1023#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1023#true} is VALID [2022-04-15 02:12:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:12:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:12:19,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252355189] [2022-04-15 02:12:19,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:12:19,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228412354] [2022-04-15 02:12:19,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228412354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:12:19,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:12:19,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 02:12:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958834276] [2022-04-15 02:12:19,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:12:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 02:12:19,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:12:19,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:19,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:19,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:12:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:12:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:12:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:12:19,312 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:19,417 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-15 02:12:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:12:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 02:12:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:12:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-15 02:12:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-15 02:12:19,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-15 02:12:19,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:19,466 INFO L225 Difference]: With dead ends: 46 [2022-04-15 02:12:19,466 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 02:12:19,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:12:19,474 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:12:19,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:12:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 02:12:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 02:12:19,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:12:19,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:19,488 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:19,488 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:19,489 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 02:12:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 02:12:19,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:19,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:19,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 02:12:19,492 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 02:12:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:19,513 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 02:12:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 02:12:19,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:19,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:19,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:12:19,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:12:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:12:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 02:12:19,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2022-04-15 02:12:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:12:19,515 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 02:12:19,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 02:12:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 02:12:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 02:12:19,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:12:19,516 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:19,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 02:12:19,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:19,728 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:12:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:12:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 461534109, now seen corresponding path program 1 times [2022-04-15 02:12:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:12:19,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408331481] [2022-04-15 02:12:19,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:12:19,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:12:19,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365782191] [2022-04-15 02:12:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:12:19,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:19,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:12:19,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:12:19,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 02:12:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:19,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 02:12:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:12:19,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:12:20,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {1295#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1295#true} is VALID [2022-04-15 02:12:20,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {1295#true} [87] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1303#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:20,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#(<= 0 ~counter~0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1303#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:20,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#(<= 0 ~counter~0)} {1295#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1303#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:20,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#(<= 0 ~counter~0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1303#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:20,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#(<= 0 ~counter~0)} [89] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~b~0_3) (= v_main_~q~0_2 0) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {1303#(<= 0 ~counter~0)} is VALID [2022-04-15 02:12:20,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {1303#(<= 0 ~counter~0)} [92] L34-3-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {1319#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:20,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#(<= 1 ~counter~0)} [96] L34-1-->L35: Formula: (< |v_main_#t~post2_5| 1) InVars {main_#t~post2=|v_main_#t~post2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post2] {1319#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:20,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {1319#(<= 1 ~counter~0)} [100] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1319#(<= 1 ~counter~0)} is VALID [2022-04-15 02:12:20,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {1319#(<= 1 ~counter~0)} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {1329#(<= 1 |main_#t~post3|)} is VALID [2022-04-15 02:12:20,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {1329#(<= 1 |main_#t~post3|)} [99] L38-->L39: Formula: (< |v_main_#t~post3_5| 1) InVars {main_#t~post3=|v_main_#t~post3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {1296#false} is VALID [2022-04-15 02:12:20,034 INFO L272 TraceCheckUtils]: 11: Hoare triple {1296#false} [104] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1296#false} is VALID [2022-04-15 02:12:20,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {1296#false} [103] __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#false} is VALID [2022-04-15 02:12:20,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1296#false} [107] 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[] {1296#false} is VALID [2022-04-15 02:12:20,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {1296#false} [112] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1296#false} is VALID [2022-04-15 02:12:20,034 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1296#false} {1296#false} [117] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {1296#false} [109] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_7 4294967296))) (and (= (* v_main_~q~0_6 2) v_main_~q~0_5) (= v_main_~b~0_6 (div .cse0 2)) (not (= (mod v_main_~B~0_5 4294967296) .cse0)))) InVars {main_~q~0=v_main_~q~0_6, main_~B~0=v_main_~B~0_5, main_~b~0=v_main_~b~0_7} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_5, main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1296#false} [113] L43-->L43-2: Formula: (and (<= (mod v_main_~b~0_8 4294967296) (mod v_main_~r~0_6 4294967296)) (= v_main_~q~0_7 (+ v_main_~q~0_8 1)) (= (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_6) v_main_~r~0_5)) InVars {main_~q~0=v_main_~q~0_8, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_6} OutVars{main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1296#false} [94] L43-2-->L38: Formula: (and (= |v_main_#t~post3_1| v_~counter~0_2) (= (+ |v_main_#t~post3_1| 1) v_~counter~0_1)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post3] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {1296#false} [98] L38-->L38-2: Formula: (not (< |v_main_#t~post3_3| 1)) InVars {main_#t~post3=|v_main_#t~post3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post3] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L272 TraceCheckUtils]: 20: Hoare triple {1296#false} [97] L38-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {1296#false} [103] __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#false} is VALID [2022-04-15 02:12:20,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {1296#false} [106] 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[] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {1296#false} [110] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1296#false} is VALID [2022-04-15 02:12:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 02:12:20,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:12:20,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:12:20,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408331481] [2022-04-15 02:12:20,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:12:20,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365782191] [2022-04-15 02:12:20,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365782191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:12:20,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:12:20,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:12:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749239105] [2022-04-15 02:12:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:12:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 02:12:20,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:12:20,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:20,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:20,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:12:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:12:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:12:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:12:20,066 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:20,116 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 02:12:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:12:20,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 02:12:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:12:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 02:12:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 02:12:20,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-15 02:12:20,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:12:20,140 INFO L225 Difference]: With dead ends: 29 [2022-04-15 02:12:20,140 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 02:12:20,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:12:20,141 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:12:20,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:12:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 02:12:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 02:12:20,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:12:20,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:12:20,144 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:12:20,144 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:12:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:20,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:12:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:12:20,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:20,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:20,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 02:12:20,144 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 02:12:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:12:20,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:12:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:12:20,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:20,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:12:20,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:12:20,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:12:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:12:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 02:12:20,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-15 02:12:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:12:20,145 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 02:12:20,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:12:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:12:20,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:12:20,147 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 02:12:20,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 02:12:20,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:12:20,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 02:12:20,481 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 02:12:20,481 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:12:20,481 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:12:20,481 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 02:12:20,481 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 02:12:20,481 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:12:20,481 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:12:20,481 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 50) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 02:12:20,481 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (or (and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 0 ~counter~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (and (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))) (<= 1 ~counter~0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 02:12:20,481 INFO L882 garLoopResultBuilder]: For program point L43-2(lines 26 50) no Hoare annotation was computed. [2022-04-15 02:12:20,481 INFO L882 garLoopResultBuilder]: For program point L34-1(lines 34 37) no Hoare annotation was computed. [2022-04-15 02:12:20,481 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 47) the Hoare annotation is: (or (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 47) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 26 50) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 26 50) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-04-15 02:12:20,482 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-04-15 02:12:20,484 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:12:20,485 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 02:12:20,488 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-15 02:12:20,490 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 02:12:20,491 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 02:12:20,491 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 02:12:20,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-15 02:12:20,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-15 02:12:20,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:12:20 BasicIcfg [2022-04-15 02:12:20,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 02:12:20,511 INFO L158 Benchmark]: Toolchain (without parser) took 10336.45ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 130.1MB in the beginning and 137.7MB in the end (delta: -7.5MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. [2022-04-15 02:12:20,511 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 02:12:20,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.38ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 129.9MB in the beginning and 205.0MB in the end (delta: -75.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-04-15 02:12:20,512 INFO L158 Benchmark]: Boogie Preprocessor took 43.35ms. Allocated memory is still 230.7MB. Free memory was 205.0MB in the beginning and 203.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 02:12:20,512 INFO L158 Benchmark]: RCFGBuilder took 270.40ms. Allocated memory is still 230.7MB. Free memory was 203.4MB in the beginning and 191.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 02:12:20,512 INFO L158 Benchmark]: IcfgTransformer took 24.73ms. Allocated memory is still 230.7MB. Free memory was 191.4MB in the beginning and 190.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 02:12:20,512 INFO L158 Benchmark]: TraceAbstraction took 9709.03ms. Allocated memory is still 230.7MB. Free memory was 189.3MB in the beginning and 137.7MB in the end (delta: 51.7MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. [2022-04-15 02:12:20,513 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.38ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 129.9MB in the beginning and 205.0MB in the end (delta: -75.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.35ms. Allocated memory is still 230.7MB. Free memory was 205.0MB in the beginning and 203.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 270.40ms. Allocated memory is still 230.7MB. Free memory was 203.4MB in the beginning and 191.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 24.73ms. Allocated memory is still 230.7MB. Free memory was 191.4MB in the beginning and 190.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9709.03ms. Allocated memory is still 230.7MB. Free memory was 189.3MB in the beginning and 137.7MB in the end (delta: 51.7MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 161 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 21 PreInvPairs, 25 NumberOfFragments, 103 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 143 ConstructedInterpolants, 8 QuantifiedInterpolants, 522 SizeOfPredicates, 9 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 12/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant [2022-04-15 02:12:20,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-15 02:12:20,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] Derived loop invariant: (((((b == 1 && A == r) && 0 <= counter) && q == 0) || !(\old(counter) <= 0)) || ((forall main_~b~0 : int :: A % 4294967296 == (r + main_~b~0 * q) % 4294967296) && 1 <= counter)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-15 02:12:20,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...