/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/dijkstra-u_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:08:28,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:08:28,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:08:29,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:08:29,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:08:29,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:08:29,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:08:29,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:08:29,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:08:29,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:08:29,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:08:29,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:08:29,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:08:29,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:08:29,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:08:29,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:08:29,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:08:29,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:08:29,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:08:29,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:08:29,048 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:08:29,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:08:29,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:08:29,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:08:29,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:08:29,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:08:29,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:08:29,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:08:29,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:08:29,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:08:29,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:08:29,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:08:29,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:08:29,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:08:29,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:08:29,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:08:29,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:08:29,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:08:29,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:08:29,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:08:29,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:08:29,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:08:29,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:08:29,081 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:08:29,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:08:29,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:08:29,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:08:29,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:08:29,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:08:29,083 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:08:29,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:08:29,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:08:29,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:08:29,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:08:29,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:08:29,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:08:29,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:08:29,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:08:29,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:08:29,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:08:29,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:08:29,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:08:29,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:29,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:08:29,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:08:29,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:08:29,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:08:29,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:08:29,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:08:29,086 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:08:29,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:08:29,087 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:08:29,087 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 23:08:29,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:08:29,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:08:29,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:08:29,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:08:29,303 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:08:29,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2022-04-27 23:08:29,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4e472fcc/1e856952e26d4592b06a828b0f871f1d/FLAGe9434b3ec [2022-04-27 23:08:29,683 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:08:29,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2022-04-27 23:08:29,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4e472fcc/1e856952e26d4592b06a828b0f871f1d/FLAGe9434b3ec [2022-04-27 23:08:30,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4e472fcc/1e856952e26d4592b06a828b0f871f1d [2022-04-27 23:08:30,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:08:30,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:08:30,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:30,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:08:30,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:08:30,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1678529d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30, skipping insertion in model container [2022-04-27 23:08:30,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:08:30,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:08:30,252 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/dijkstra-u_unwindbound20.c[525,538] [2022-04-27 23:08:30,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:30,278 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:08:30,285 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/dijkstra-u_unwindbound20.c[525,538] [2022-04-27 23:08:30,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:30,304 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:08:30,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30 WrapperNode [2022-04-27 23:08:30,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:30,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:08:30,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:08:30,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:08:30,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:08:30,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:08:30,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:08:30,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:08:30,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:30,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:08:30,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:08:30,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:08:30,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:08:30,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:08:30,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:08:30,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:08:30,382 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:08:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:08:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:08:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:08:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:08:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 23:08:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:08:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:08:30,422 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:08:30,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:08:30,562 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:08:30,567 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:08:30,567 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:08:30,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:30 BoogieIcfgContainer [2022-04-27 23:08:30,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:08:30,569 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:08:30,569 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:08:30,570 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:08:30,572 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,573 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:08:30,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:30 BasicIcfg [2022-04-27 23:08:30,594 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:08:30,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:08:30,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:08:30,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:08:30,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:08:30" (1/4) ... [2022-04-27 23:08:30,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d23428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:30, skipping insertion in model container [2022-04-27 23:08:30,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:30" (2/4) ... [2022-04-27 23:08:30,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d23428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:30, skipping insertion in model container [2022-04-27 23:08:30,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:30" (3/4) ... [2022-04-27 23:08:30,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d23428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:08:30, skipping insertion in model container [2022-04-27 23:08:30,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:30" (4/4) ... [2022-04-27 23:08:30,599 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound20.cqvasr [2022-04-27 23:08:30,608 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:08:30,608 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:08:30,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:08:30,662 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2501b8e3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72cc76d1 [2022-04-27 23:08:30,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:08:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 23:08:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 23:08:30,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:30,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:30,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:30,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash -460462115, now seen corresponding path program 1 times [2022-04-27 23:08:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:30,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415141210] [2022-04-27 23:08:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:30,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:30,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {42#true} is VALID [2022-04-27 23:08:30,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:30,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:30,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 23:08:30,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:30,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {42#true} is VALID [2022-04-27 23:08:30,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#true} is VALID [2022-04-27 23:08:30,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:30,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:30,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 23:08:30,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-27 23:08:30,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} [114] L30-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} [118] L52-2-->L38-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,886 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-27 23:08:30,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-27 23:08:30,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,887 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-27 23:08:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415141210] [2022-04-27 23:08:30,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415141210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:30,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:30,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:08:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37554649] [2022-04-27 23:08:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:30,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:08:30,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:30,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:30,942 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-27 23:08:30,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:08:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:30,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:08:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:08:30,967 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:38,447 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 23:08:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:08:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:08:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:08:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:08:38,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 23:08:38,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:38,615 INFO L225 Difference]: With dead ends: 70 [2022-04-27 23:08:38,615 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 23:08:38,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:08:38,619 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:38,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 23:08:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 23:08:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 23:08:38,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:38,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,640 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,640 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:38,645 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 23:08:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 23:08:38,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:38,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:38,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 23:08:38,647 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 23:08:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:38,651 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 23:08:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 23:08:38,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:38,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:38,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:38,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 23:08:38,656 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 23:08:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:38,657 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 23:08:38,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 23:08:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 23:08:38,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:38,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:38,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:08:38,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash -889932734, now seen corresponding path program 1 times [2022-04-27 23:08:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:38,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202031529] [2022-04-27 23:08:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:38,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:38,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951736085] [2022-04-27 23:08:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:38,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:38,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:38,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:08:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:38,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:08:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:38,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:38,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:38,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,908 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:38,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {316#(<= |main_#t~post5| 0)} is VALID [2022-04-27 23:08:38,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {275#false} is VALID [2022-04-27 23:08:38,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {275#false} is VALID [2022-04-27 23:08:38,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {275#false} is VALID [2022-04-27 23:08:38,911 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {275#false} is VALID [2022-04-27 23:08:38,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {275#false} is VALID [2022-04-27 23:08:38,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-27 23:08:38,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-27 23:08:38,912 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-27 23:08:38,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:38,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:38,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202031529] [2022-04-27 23:08:38,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:38,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951736085] [2022-04-27 23:08:38,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951736085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:38,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:38,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 23:08:38,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433467290] [2022-04-27 23:08:38,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:38,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 23:08:38,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:38,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:38,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:38,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 23:08:38,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:38,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 23:08:38,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:08:38,928 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:43,747 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 23:08:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 23:08:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 23:08:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 23:08:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 23:08:43,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 23:08:43,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:43,828 INFO L225 Difference]: With dead ends: 55 [2022-04-27 23:08:43,828 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 23:08:43,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:08:43,829 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:43,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 23:08:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 23:08:43,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:43,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:43,837 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:43,837 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:43,839 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 23:08:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:43,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:43,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:43,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 23:08:43,840 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 23:08:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:43,842 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 23:08:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:43,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:43,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:43,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:43,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 23:08:43,845 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 23:08:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:43,845 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 23:08:43,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 23:08:43,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:43,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:43,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 23:08:44,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:44,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1699853977, now seen corresponding path program 1 times [2022-04-27 23:08:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:44,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841544701] [2022-04-27 23:08:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:44,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658998256] [2022-04-27 23:08:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:44,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:44,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:44,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:08:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:44,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:08:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:44,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:44,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#true} is VALID [2022-04-27 23:08:44,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:44,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:44,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:44,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:44,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {598#(<= |main_#t~post6| 1)} is VALID [2022-04-27 23:08:44,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {547#false} is VALID [2022-04-27 23:08:44,267 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {547#false} is VALID [2022-04-27 23:08:44,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {547#false} is VALID [2022-04-27 23:08:44,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {547#false} is VALID [2022-04-27 23:08:44,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#false} is VALID [2022-04-27 23:08:44,268 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-27 23:08:44,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841544701] [2022-04-27 23:08:44,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658998256] [2022-04-27 23:08:44,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658998256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:44,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:44,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:08:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500690362] [2022-04-27 23:08:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 23:08:44,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:44,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:44,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:44,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:08:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:08:44,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:08:44,284 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:50,441 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 23:08:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:08:50,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 23:08:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:08:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:08:50,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 23:08:50,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:50,525 INFO L225 Difference]: With dead ends: 49 [2022-04-27 23:08:50,525 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 23:08:50,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:08:50,526 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:50,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 23:08:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 23:08:50,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:50,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:50,533 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:50,533 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:50,535 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 23:08:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 23:08:50,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:50,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:50,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 23:08:50,536 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 23:08:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:50,538 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 23:08:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 23:08:50,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:50,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:50,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:50,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 23:08:50,540 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 23:08:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:50,540 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 23:08:50,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 23:08:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 23:08:50,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:50,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:50,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:50,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 23:08:50,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1700986035, now seen corresponding path program 1 times [2022-04-27 23:08:50,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:50,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123426577] [2022-04-27 23:08:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:50,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {822#true} is VALID [2022-04-27 23:08:50,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:50,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-27 23:08:50,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:50,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:50,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {822#true} is VALID [2022-04-27 23:08:50,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {822#true} is VALID [2022-04-27 23:08:50,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:50,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-27 23:08:50,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:50,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:50,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:50,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:50,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:50,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:50,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:50,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:50,966 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:50,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:08:50,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {823#false} is VALID [2022-04-27 23:08:50,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {823#false} is VALID [2022-04-27 23:08:50,967 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-27 23:08:50,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:50,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123426577] [2022-04-27 23:08:50,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123426577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:50,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:50,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 23:08:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305647754] [2022-04-27 23:08:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 23:08:50,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:50,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:50,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:50,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:08:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:08:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:08:50,989 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:59,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:01,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:03,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:17,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:19,855 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 23:09:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:09:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 23:09:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 23:09:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 23:09:19,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 23:09:20,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:20,105 INFO L225 Difference]: With dead ends: 72 [2022-04-27 23:09:20,105 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 23:09:20,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:09:20,107 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:20,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 206 Invalid, 3 Unknown, 0 Unchecked, 16.5s Time] [2022-04-27 23:09:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 23:09:20,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 23:09:20,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:20,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:20,149 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:20,149 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:20,152 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 23:09:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:20,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:20,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:20,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 23:09:20,153 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 23:09:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:20,155 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 23:09:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:20,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:20,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:20,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:20,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 23:09:20,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 23:09:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:20,157 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 23:09:20,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:09:20,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:20,158 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:20,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 23:09:20,158 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1908885951, now seen corresponding path program 1 times [2022-04-27 23:09:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:20,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636537922] [2022-04-27 23:09:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:20,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:20,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868623135] [2022-04-27 23:09:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:20,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:20,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:09:20,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:09:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:20,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:09:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:20,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:20,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:20,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:20,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:20,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:20,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:20,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-27 23:09:20,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-27 23:09:20,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:20,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:20,343 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-27 23:09:20,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1138#false} is VALID [2022-04-27 23:09:20,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:20,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:20,344 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-27 23:09:20,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:20,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:20,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:20,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1138#false} is VALID [2022-04-27 23:09:20,488 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-27 23:09:20,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:20,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:20,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 20)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-27 23:09:20,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 20)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1229#(< |main_#t~post5| 20)} is VALID [2022-04-27 23:09:20,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 20)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1233#(< ~counter~0 20)} is VALID [2022-04-27 23:09:20,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 20)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1233#(< ~counter~0 20)} is VALID [2022-04-27 23:09:20,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 19)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1233#(< ~counter~0 20)} is VALID [2022-04-27 23:09:20,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 19)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1243#(< ~counter~0 19)} is VALID [2022-04-27 23:09:20,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 19)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1243#(< ~counter~0 19)} is VALID [2022-04-27 23:09:20,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:20,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:20,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1137#true} is VALID [2022-04-27 23:09:20,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 19)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1137#true} is VALID [2022-04-27 23:09:20,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 19)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1243#(< ~counter~0 19)} is VALID [2022-04-27 23:09:20,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 19)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 19)} is VALID [2022-04-27 23:09:20,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 19)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 19)} is VALID [2022-04-27 23:09:20,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 19)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 19)} is VALID [2022-04-27 23:09:20,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {1243#(< ~counter~0 19)} is VALID [2022-04-27 23:09:20,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:20,497 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-27 23:09:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:20,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636537922] [2022-04-27 23:09:20,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:20,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868623135] [2022-04-27 23:09:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868623135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:20,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:09:20,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 23:09:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716032898] [2022-04-27 23:09:20,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 23:09:20,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:20,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:20,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:20,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:09:20,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:20,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:09:20,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:09:20,526 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:22,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:25,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:36,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:38,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:48,649 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-27 23:09:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:09:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 23:09:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-27 23:09:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-27 23:09:48,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 137 transitions. [2022-04-27 23:09:48,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:48,773 INFO L225 Difference]: With dead ends: 108 [2022-04-27 23:09:48,773 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 23:09:48,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:09:48,774 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:48,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 247 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 10.8s Time] [2022-04-27 23:09:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 23:09:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-27 23:09:48,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:48,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:48,799 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:48,800 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:48,809 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 23:09:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 23:09:48,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:48,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:48,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 23:09:48,812 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 23:09:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:48,818 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 23:09:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 23:09:48,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:48,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:48,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:48,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-27 23:09:48,822 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-27 23:09:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:48,822 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-27 23:09:48,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-27 23:09:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:09:48,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:48,823 INFO L195 NwaCegarLoop]: 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-27 23:09:48,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 23:09:49,023 WARN L477 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-27 23:09:49,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1731080004, now seen corresponding path program 1 times [2022-04-27 23:09:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:49,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926238581] [2022-04-27 23:09:49,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:49,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:49,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343088222] [2022-04-27 23:09:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:49,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:49,050 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:09:49,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:09:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:49,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:09:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:49,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:49,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-27 23:09:49,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1731#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:49,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1765#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:49,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1765#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:49,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1765#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:49,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1775#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:49,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1775#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:49,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1775#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:49,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-27 23:09:49,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1724#false} is VALID [2022-04-27 23:09:49,231 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1724#false} is VALID [2022-04-27 23:09:49,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1724#false} is VALID [2022-04-27 23:09:49,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-27 23:09:49,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-27 23:09:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:49,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:49,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-27 23:09:49,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-27 23:09:49,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1724#false} is VALID [2022-04-27 23:09:49,375 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1724#false} is VALID [2022-04-27 23:09:49,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 20)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1724#false} is VALID [2022-04-27 23:09:49,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 20)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1813#(< |main_#t~post6| 20)} is VALID [2022-04-27 23:09:49,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 20)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1817#(< ~counter~0 20)} is VALID [2022-04-27 23:09:49,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 20)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1817#(< ~counter~0 20)} is VALID [2022-04-27 23:09:49,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 19)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1817#(< ~counter~0 20)} is VALID [2022-04-27 23:09:49,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 19)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1827#(< ~counter~0 19)} is VALID [2022-04-27 23:09:49,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 19)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1827#(< ~counter~0 19)} is VALID [2022-04-27 23:09:49,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {1837#(< ~counter~0 18)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1827#(< ~counter~0 19)} is VALID [2022-04-27 23:09:49,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#(< ~counter~0 18)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1837#(< ~counter~0 18)} is VALID [2022-04-27 23:09:49,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1837#(< ~counter~0 18)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1837#(< ~counter~0 18)} is VALID [2022-04-27 23:09:49,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-27 23:09:49,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-27 23:09:49,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1723#true} is VALID [2022-04-27 23:09:49,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#(< ~counter~0 18)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1723#true} is VALID [2022-04-27 23:09:49,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#(< ~counter~0 18)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1837#(< ~counter~0 18)} is VALID [2022-04-27 23:09:49,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(< ~counter~0 18)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1837#(< ~counter~0 18)} is VALID [2022-04-27 23:09:49,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(< ~counter~0 18)} {1723#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1837#(< ~counter~0 18)} is VALID [2022-04-27 23:09:49,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(< ~counter~0 18)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1837#(< ~counter~0 18)} is VALID [2022-04-27 23:09:49,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {1837#(< ~counter~0 18)} is VALID [2022-04-27 23:09:49,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-27 23:09:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926238581] [2022-04-27 23:09:49,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343088222] [2022-04-27 23:09:49,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343088222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:49,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:09:49,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 23:09:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168243839] [2022-04-27 23:09:49,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 23:09:49,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:49,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:49,411 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-27 23:09:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:09:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:09:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:09:49,412 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:10:10,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:20,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:27,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:36,639 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2022-04-27 23:10:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 23:10:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 23:10:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:10:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2022-04-27 23:10:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:10:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2022-04-27 23:10:36,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 155 transitions. [2022-04-27 23:10:36,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:36,765 INFO L225 Difference]: With dead ends: 127 [2022-04-27 23:10:36,765 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 23:10:36,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 23:10:36,766 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 99 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 41 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:36,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 301 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 9.9s Time] [2022-04-27 23:10:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 23:10:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2022-04-27 23:10:36,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:36,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 109 states, 64 states have (on average 1.28125) internal successors, (82), 69 states have internal predecessors, (82), 35 states have call successors, (35), 10 states have call predecessors, (35), 9 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:10:36,810 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 109 states, 64 states have (on average 1.28125) internal successors, (82), 69 states have internal predecessors, (82), 35 states have call successors, (35), 10 states have call predecessors, (35), 9 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:10:36,811 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 109 states, 64 states have (on average 1.28125) internal successors, (82), 69 states have internal predecessors, (82), 35 states have call successors, (35), 10 states have call predecessors, (35), 9 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:10:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:36,814 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-27 23:10:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-04-27 23:10:36,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:36,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:36,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 64 states have (on average 1.28125) internal successors, (82), 69 states have internal predecessors, (82), 35 states have call successors, (35), 10 states have call predecessors, (35), 9 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 118 states. [2022-04-27 23:10:36,815 INFO L87 Difference]: Start difference. First operand has 109 states, 64 states have (on average 1.28125) internal successors, (82), 69 states have internal predecessors, (82), 35 states have call successors, (35), 10 states have call predecessors, (35), 9 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 118 states. [2022-04-27 23:10:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:36,818 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-27 23:10:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-04-27 23:10:36,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:36,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:36,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:36,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 64 states have (on average 1.28125) internal successors, (82), 69 states have internal predecessors, (82), 35 states have call successors, (35), 10 states have call predecessors, (35), 9 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:10:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 148 transitions. [2022-04-27 23:10:36,825 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 148 transitions. Word has length 24 [2022-04-27 23:10:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:36,826 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 148 transitions. [2022-04-27 23:10:36,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:10:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2022-04-27 23:10:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:10:36,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:36,827 INFO L195 NwaCegarLoop]: 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-27 23:10:36,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:10:37,039 WARN L477 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-27 23:10:37,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1729947946, now seen corresponding path program 1 times [2022-04-27 23:10:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:37,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272992018] [2022-04-27 23:10:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:10:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:37,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {2477#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {2463#true} is VALID [2022-04-27 23:10:37,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {2463#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2463#true} {2463#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:10:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:37,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2463#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2463#true} is VALID [2022-04-27 23:10:37,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2463#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2463#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2463#true} {2463#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2463#true} is VALID [2022-04-27 23:10:37,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {2463#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2477#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:10:37,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2477#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {2463#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2463#true} {2463#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {2463#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {2463#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {2463#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {2463#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {2463#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2463#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:37,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2463#true} {2463#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2463#true} is VALID [2022-04-27 23:10:37,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {2463#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:37,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:37,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:37,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2473#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:37,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {2473#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2473#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:37,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {2473#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2473#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:37,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {2473#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2474#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:37,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {2474#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2474#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:37,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {2474#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2474#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:37,263 INFO L272 TraceCheckUtils]: 20: Hoare triple {2474#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2475#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:10:37,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {2475#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2476#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:10:37,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {2476#(not (= __VERIFIER_assert_~cond 0))} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2464#false} is VALID [2022-04-27 23:10:37,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {2464#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2464#false} is VALID [2022-04-27 23:10:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:10:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:10:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272992018] [2022-04-27 23:10:37,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272992018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:10:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138034619] [2022-04-27 23:10:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:37,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:37,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:37,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:10:37,272 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-27 23:10:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:37,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 23:10:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:37,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:10:38,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {2463#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {2463#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {2463#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2463#true} {2463#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {2463#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {2463#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {2463#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {2463#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {2463#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2463#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2463#true} {2463#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2463#true} is VALID [2022-04-27 23:10:38,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {2463#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:38,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:38,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:38,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {2472#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2523#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:38,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {2523#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2523#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:38,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {2523#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2523#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:38,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {2523#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2533#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 23:10:38,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {2533#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2533#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 23:10:38,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {2533#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2533#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 23:10:38,068 INFO L272 TraceCheckUtils]: 20: Hoare triple {2533#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:38,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {2543#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:38,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {2547#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2464#false} is VALID [2022-04-27 23:10:38,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {2464#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2464#false} is VALID [2022-04-27 23:10:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:10:38,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:10:38,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {2464#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2464#false} is VALID [2022-04-27 23:10:38,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {2547#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2464#false} is VALID [2022-04-27 23:10:38,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {2543#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:38,266 INFO L272 TraceCheckUtils]: 20: Hoare triple {2563#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:38,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {2563#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2563#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:10:38,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {2563#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2563#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:10:38,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {2573#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2563#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:10:38,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {2573#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2573#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 23:10:38,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {2573#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2573#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 23:10:38,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {2583#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2573#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 23:10:38,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {2583#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2583#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 23:10:38,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {2583#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2583#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 23:10:38,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {2463#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2583#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 23:10:38,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2463#true} {2463#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {2463#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {2463#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {2463#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {2463#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {2463#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {2463#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2463#true} {2463#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {2463#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {2463#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {2463#true} is VALID [2022-04-27 23:10:38,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {2463#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#true} is VALID [2022-04-27 23:10:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:10:38,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138034619] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:10:38,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 23:10:38,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 23:10:38,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146512667] [2022-04-27 23:10:38,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 23:10:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 23:10:38,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:10:38,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:10:38,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 23:10:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:10:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 23:10:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 23:10:38,331 INFO L87 Difference]: Start difference. First operand 109 states and 148 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:10:42,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:44,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:46,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:48,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:54,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:56,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:59,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:01,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:06,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:11:08,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:11:12,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:15,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:21,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:26,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:39,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:11:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:46,027 INFO L93 Difference]: Finished difference Result 168 states and 234 transitions. [2022-04-27 23:11:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 23:11:46,027 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 23:11:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:11:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:11:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2022-04-27 23:11:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:11:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2022-04-27 23:11:46,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 144 transitions. [2022-04-27 23:11:46,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:46,647 INFO L225 Difference]: With dead ends: 168 [2022-04-27 23:11:46,647 INFO L226 Difference]: Without dead ends: 155 [2022-04-27 23:11:46,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-27 23:11:46,648 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 67 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 141 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:11:46,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 181 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 559 Invalid, 12 Unknown, 0 Unchecked, 41.1s Time] [2022-04-27 23:11:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-27 23:11:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2022-04-27 23:11:46,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:11:46,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 150 states, 86 states have (on average 1.244186046511628) internal successors, (107), 92 states have internal predecessors, (107), 50 states have call successors, (50), 14 states have call predecessors, (50), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 23:11:46,743 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 150 states, 86 states have (on average 1.244186046511628) internal successors, (107), 92 states have internal predecessors, (107), 50 states have call successors, (50), 14 states have call predecessors, (50), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 23:11:46,743 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 150 states, 86 states have (on average 1.244186046511628) internal successors, (107), 92 states have internal predecessors, (107), 50 states have call successors, (50), 14 states have call predecessors, (50), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 23:11:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:46,748 INFO L93 Difference]: Finished difference Result 155 states and 211 transitions. [2022-04-27 23:11:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 211 transitions. [2022-04-27 23:11:46,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:46,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:46,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 86 states have (on average 1.244186046511628) internal successors, (107), 92 states have internal predecessors, (107), 50 states have call successors, (50), 14 states have call predecessors, (50), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 155 states. [2022-04-27 23:11:46,750 INFO L87 Difference]: Start difference. First operand has 150 states, 86 states have (on average 1.244186046511628) internal successors, (107), 92 states have internal predecessors, (107), 50 states have call successors, (50), 14 states have call predecessors, (50), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 155 states. [2022-04-27 23:11:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:46,755 INFO L93 Difference]: Finished difference Result 155 states and 211 transitions. [2022-04-27 23:11:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 211 transitions. [2022-04-27 23:11:46,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:46,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:46,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:11:46,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:11:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 86 states have (on average 1.244186046511628) internal successors, (107), 92 states have internal predecessors, (107), 50 states have call successors, (50), 14 states have call predecessors, (50), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 23:11:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 203 transitions. [2022-04-27 23:11:46,761 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 203 transitions. Word has length 24 [2022-04-27 23:11:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:11:46,761 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 203 transitions. [2022-04-27 23:11:46,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:11:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 203 transitions. [2022-04-27 23:11:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 23:11:46,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:11:46,762 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:11:46,784 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-27 23:11:46,975 WARN L477 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-27 23:11:46,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:11:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:11:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2026335537, now seen corresponding path program 1 times [2022-04-27 23:11:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:11:46,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246586645] [2022-04-27 23:11:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:46,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:11:46,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:11:46,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822065308] [2022-04-27 23:11:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:11:47,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:11:47,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 23:11:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:47,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:11:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:47,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:11:47,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {3422#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {3422#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {3422#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3422#true} {3422#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {3422#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {3422#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {3422#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {3422#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {3422#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {3422#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3422#true} {3422#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {3422#true} is VALID [2022-04-27 23:11:47,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {3422#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,299 INFO L272 TraceCheckUtils]: 17: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {3422#true} is VALID [2022-04-27 23:11:47,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {3422#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3422#true} is VALID [2022-04-27 23:11:47,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {3422#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {3422#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,300 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3422#true} {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [150] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,300 INFO L272 TraceCheckUtils]: 22: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [134] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {3422#true} is VALID [2022-04-27 23:11:47,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {3422#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3422#true} is VALID [2022-04-27 23:11:47,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {3422#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {3422#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3422#true} is VALID [2022-04-27 23:11:47,301 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3422#true} {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:47,302 INFO L272 TraceCheckUtils]: 27: Hoare triple {3460#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [139] L40-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* (* v_main_~q~0_18 (* v_main_~n~0_18 .cse0)) 4294967295) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_18 16))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_18, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {3509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:11:47,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {3509#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:11:47,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {3513#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3423#false} is VALID [2022-04-27 23:11:47,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {3423#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#false} is VALID [2022-04-27 23:11:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:11:47,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:11:47,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:11:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246586645] [2022-04-27 23:11:47,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:11:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822065308] [2022-04-27 23:11:47,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822065308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:11:47,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:11:47,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:11:47,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726879427] [2022-04-27 23:11:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:11:47,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 23:11:47,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:11:47,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:47,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:47,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:11:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:11:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:11:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:11:47,328 INFO L87 Difference]: Start difference. First operand 150 states and 203 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:50,839 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2022-04-27 23:11:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:11:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 23:11:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:11:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 23:11:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 23:11:50,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 23:11:50,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:50,924 INFO L225 Difference]: With dead ends: 161 [2022-04-27 23:11:50,924 INFO L226 Difference]: Without dead ends: 129 [2022-04-27 23:11:50,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-27 23:11:50,926 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 23:11:50,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 23:11:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-27 23:11:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-27 23:11:50,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:11:50,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 80 states have internal predecessors, (93), 44 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 23:11:50,983 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 80 states have internal predecessors, (93), 44 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 23:11:50,985 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 80 states have internal predecessors, (93), 44 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 23:11:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:50,989 INFO L93 Difference]: Finished difference Result 129 states and 177 transitions. [2022-04-27 23:11:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 177 transitions. [2022-04-27 23:11:50,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:50,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:50,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 80 states have internal predecessors, (93), 44 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) Second operand 129 states. [2022-04-27 23:11:50,992 INFO L87 Difference]: Start difference. First operand has 129 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 80 states have internal predecessors, (93), 44 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) Second operand 129 states. [2022-04-27 23:11:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:50,995 INFO L93 Difference]: Finished difference Result 129 states and 177 transitions. [2022-04-27 23:11:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 177 transitions. [2022-04-27 23:11:50,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:50,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:50,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:11:50,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:11:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 80 states have internal predecessors, (93), 44 states have call successors, (44), 11 states have call predecessors, (44), 10 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 23:11:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 177 transitions. [2022-04-27 23:11:51,001 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 177 transitions. Word has length 31 [2022-04-27 23:11:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:11:51,001 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 177 transitions. [2022-04-27 23:11:51,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 177 transitions. [2022-04-27 23:11:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 23:11:51,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:11:51,003 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:11:51,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 23:11:51,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:51,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:11:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:11:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -266035918, now seen corresponding path program 1 times [2022-04-27 23:11:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:11:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003975457] [2022-04-27 23:11:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:11:51,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:11:51,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422508111] [2022-04-27 23:11:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:11:51,240 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:11:51,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 23:11:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:51,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:11:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:51,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:11:51,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {4203#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {4203#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {4203#true} is VALID [2022-04-27 23:11:51,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {4203#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4203#true} {4203#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {4203#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {4203#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4203#true} is VALID [2022-04-27 23:11:51,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {4203#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4203#true} is VALID [2022-04-27 23:11:51,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {4203#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4203#true} is VALID [2022-04-27 23:11:51,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4203#true} {4203#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4203#true} is VALID [2022-04-27 23:11:51,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {4203#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,525 INFO L272 TraceCheckUtils]: 20: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4203#true} is VALID [2022-04-27 23:11:51,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {4203#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4203#true} is VALID [2022-04-27 23:11:51,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {4203#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {4203#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,526 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4203#true} {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [150] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,526 INFO L272 TraceCheckUtils]: 25: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [134] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {4203#true} is VALID [2022-04-27 23:11:51,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {4203#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4203#true} is VALID [2022-04-27 23:11:51,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {4203#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {4203#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4203#true} is VALID [2022-04-27 23:11:51,526 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4203#true} {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {4241#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:51,527 INFO L272 TraceCheckUtils]: 30: Hoare triple {4241#(and (= main_~p~0 0) (= main_~h~0 0))} [139] L40-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* (* v_main_~q~0_18 (* v_main_~n~0_18 .cse0)) 4294967295) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_18 16))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_18, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:11:51,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {4299#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:11:51,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {4303#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4204#false} is VALID [2022-04-27 23:11:51,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {4204#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4204#false} is VALID [2022-04-27 23:11:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 23:11:51,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:11:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:11:51,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003975457] [2022-04-27 23:11:51,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:11:51,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422508111] [2022-04-27 23:11:51,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422508111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:11:51,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:11:51,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:11:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370977234] [2022-04-27 23:11:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:11:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 23:11:51,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:11:51,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:51,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:51,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:11:51,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:11:51,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:11:51,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:11:51,559 INFO L87 Difference]: Start difference. First operand 129 states and 177 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:57,521 INFO L93 Difference]: Finished difference Result 151 states and 199 transitions. [2022-04-27 23:11:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:11:57,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 23:11:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:11:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 23:11:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 23:11:57,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-27 23:11:57,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:57,599 INFO L225 Difference]: With dead ends: 151 [2022-04-27 23:11:57,600 INFO L226 Difference]: Without dead ends: 146 [2022-04-27 23:11:57,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-27 23:11:57,600 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 23:11:57,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 23:11:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-27 23:11:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2022-04-27 23:11:57,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:11:57,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 140 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 23:11:57,645 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 140 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 23:11:57,646 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 140 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 23:11:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:57,649 INFO L93 Difference]: Finished difference Result 146 states and 187 transitions. [2022-04-27 23:11:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2022-04-27 23:11:57,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:57,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:57,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) Second operand 146 states. [2022-04-27 23:11:57,650 INFO L87 Difference]: Start difference. First operand has 140 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) Second operand 146 states. [2022-04-27 23:11:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:57,656 INFO L93 Difference]: Finished difference Result 146 states and 187 transitions. [2022-04-27 23:11:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2022-04-27 23:11:57,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:57,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:57,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:11:57,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:11:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 23:11:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2022-04-27 23:11:57,659 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 178 transitions. Word has length 34 [2022-04-27 23:11:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:11:57,660 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 178 transitions. [2022-04-27 23:11:57,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 178 transitions. [2022-04-27 23:11:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 23:11:57,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:11:57,660 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:11:57,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 23:11:57,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:57,865 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:11:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:11:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1209382940, now seen corresponding path program 1 times [2022-04-27 23:11:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:11:57,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899110721] [2022-04-27 23:11:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:11:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:11:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:57,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {5040#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {5030#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5030#(<= ~counter~0 0)} {5025#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:11:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:57,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {5025#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5025#true} is VALID [2022-04-27 23:11:57,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {5025#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:57,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {5025#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:57,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5025#true} {5030#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {5025#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5040#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:11:57,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {5030#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5030#(<= ~counter~0 0)} {5025#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {5030#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {5030#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {5030#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5025#true} is VALID [2022-04-27 23:11:57,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {5025#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5025#true} is VALID [2022-04-27 23:11:57,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {5025#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:57,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {5025#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:57,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5025#true} {5030#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {5030#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:57,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {5030#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5035#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:57,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {5035#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5035#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:57,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {5035#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5035#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:57,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {5035#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5036#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:57,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {5036#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5036#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:57,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {5036#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5036#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:57,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {5036#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5037#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:57,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {5037#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5037#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:57,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {5037#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5037#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:57,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {5037#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5038#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:57,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {5038#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5038#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:57,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {5038#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5038#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:57,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {5038#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5039#(<= |main_#t~post5| 4)} is VALID [2022-04-27 23:11:57,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {5039#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5026#false} is VALID [2022-04-27 23:11:57,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {5026#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5026#false} is VALID [2022-04-27 23:11:57,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {5026#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5026#false} is VALID [2022-04-27 23:11:57,999 INFO L272 TraceCheckUtils]: 28: Hoare triple {5026#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {5026#false} is VALID [2022-04-27 23:11:58,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {5026#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5026#false} is VALID [2022-04-27 23:11:58,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {5026#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5026#false} is VALID [2022-04-27 23:11:58,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {5026#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5026#false} is VALID [2022-04-27 23:11:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:11:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:11:58,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899110721] [2022-04-27 23:11:58,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899110721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:11:58,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880889590] [2022-04-27 23:11:58,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:58,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:58,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:11:58,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:11:58,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 23:11:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:58,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 23:11:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:58,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:11:58,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {5025#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:58,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {5025#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {5030#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5030#(<= ~counter~0 0)} {5025#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {5030#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {5030#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {5030#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {5030#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {5030#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {5030#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5030#(<= ~counter~0 0)} {5030#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {5030#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {5030#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:58,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {5030#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5035#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:58,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {5035#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5035#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:58,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {5035#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5035#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:58,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {5035#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5036#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:58,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {5036#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5036#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:58,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {5036#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5036#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:58,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {5036#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5037#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:58,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {5037#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5037#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:58,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {5037#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5037#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:58,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {5037#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5038#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:58,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {5038#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5038#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:58,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {5038#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5038#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:58,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {5038#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5039#(<= |main_#t~post5| 4)} is VALID [2022-04-27 23:11:58,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {5039#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5026#false} is VALID [2022-04-27 23:11:58,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {5026#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5026#false} is VALID [2022-04-27 23:11:58,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {5026#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5026#false} is VALID [2022-04-27 23:11:58,244 INFO L272 TraceCheckUtils]: 28: Hoare triple {5026#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {5026#false} is VALID [2022-04-27 23:11:58,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {5026#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5026#false} is VALID [2022-04-27 23:11:58,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {5026#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5026#false} is VALID [2022-04-27 23:11:58,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {5026#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5026#false} is VALID [2022-04-27 23:11:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:11:58,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:11:58,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {5026#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5026#false} is VALID [2022-04-27 23:11:58,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {5026#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5026#false} is VALID [2022-04-27 23:11:58,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {5026#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5026#false} is VALID [2022-04-27 23:11:58,490 INFO L272 TraceCheckUtils]: 28: Hoare triple {5026#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {5026#false} is VALID [2022-04-27 23:11:58,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {5026#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5026#false} is VALID [2022-04-27 23:11:58,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {5026#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5026#false} is VALID [2022-04-27 23:11:58,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {5155#(< |main_#t~post5| 20)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5026#false} is VALID [2022-04-27 23:11:58,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {5159#(< ~counter~0 20)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5155#(< |main_#t~post5| 20)} is VALID [2022-04-27 23:11:58,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {5159#(< ~counter~0 20)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5159#(< ~counter~0 20)} is VALID [2022-04-27 23:11:58,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {5159#(< ~counter~0 20)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5159#(< ~counter~0 20)} is VALID [2022-04-27 23:11:58,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {5169#(< ~counter~0 19)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5159#(< ~counter~0 20)} is VALID [2022-04-27 23:11:58,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {5169#(< ~counter~0 19)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5169#(< ~counter~0 19)} is VALID [2022-04-27 23:11:58,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {5169#(< ~counter~0 19)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5169#(< ~counter~0 19)} is VALID [2022-04-27 23:11:58,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {5179#(< ~counter~0 18)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5169#(< ~counter~0 19)} is VALID [2022-04-27 23:11:58,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {5179#(< ~counter~0 18)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5179#(< ~counter~0 18)} is VALID [2022-04-27 23:11:58,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {5179#(< ~counter~0 18)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5179#(< ~counter~0 18)} is VALID [2022-04-27 23:11:58,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {5189#(< ~counter~0 17)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5179#(< ~counter~0 18)} is VALID [2022-04-27 23:11:58,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {5189#(< ~counter~0 17)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5189#(< ~counter~0 17)} is VALID [2022-04-27 23:11:58,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {5189#(< ~counter~0 17)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5189#(< ~counter~0 17)} is VALID [2022-04-27 23:11:58,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {5199#(< ~counter~0 16)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5189#(< ~counter~0 17)} is VALID [2022-04-27 23:11:58,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {5199#(< ~counter~0 16)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {5199#(< ~counter~0 16)} is VALID [2022-04-27 23:11:58,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5025#true} {5199#(< ~counter~0 16)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5199#(< ~counter~0 16)} is VALID [2022-04-27 23:11:58,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {5025#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:58,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {5025#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:58,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {5025#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5025#true} is VALID [2022-04-27 23:11:58,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {5199#(< ~counter~0 16)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5025#true} is VALID [2022-04-27 23:11:58,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {5199#(< ~counter~0 16)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {5199#(< ~counter~0 16)} is VALID [2022-04-27 23:11:58,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {5199#(< ~counter~0 16)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5199#(< ~counter~0 16)} is VALID [2022-04-27 23:11:58,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5199#(< ~counter~0 16)} {5025#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5199#(< ~counter~0 16)} is VALID [2022-04-27 23:11:58,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {5199#(< ~counter~0 16)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5199#(< ~counter~0 16)} is VALID [2022-04-27 23:11:58,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {5025#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {5199#(< ~counter~0 16)} is VALID [2022-04-27 23:11:58,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {5025#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5025#true} is VALID [2022-04-27 23:11:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:11:58,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880889590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:11:58,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 23:11:58,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-27 23:11:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829680061] [2022-04-27 23:11:58,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 23:11:58,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-27 23:11:58,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:11:58,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:11:58,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:58,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 23:11:58,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:11:58,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 23:11:58,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-27 23:11:58,541 INFO L87 Difference]: Start difference. First operand 140 states and 178 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:12:12,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:15,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:12:18,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:20,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:25,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:33,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:42,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:45,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:49,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:51,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:53,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:58,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:13:04,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:13:07,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:13:12,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:13:14,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:13:21,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:13:23,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:13:26,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:13:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:13:32,410 INFO L93 Difference]: Finished difference Result 404 states and 530 transitions. [2022-04-27 23:13:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 23:13:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-27 23:13:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:13:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:13:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 293 transitions. [2022-04-27 23:13:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:13:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 293 transitions. [2022-04-27 23:13:32,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 293 transitions. [2022-04-27 23:13:32,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:13:32,707 INFO L225 Difference]: With dead ends: 404 [2022-04-27 23:13:32,707 INFO L226 Difference]: Without dead ends: 360 [2022-04-27 23:13:32,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-27 23:13:32,708 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 251 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 198 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.4s IncrementalHoareTripleChecker+Time [2022-04-27 23:13:32,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 202 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 449 Invalid, 18 Unknown, 0 Unchecked, 57.4s Time] [2022-04-27 23:13:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-27 23:13:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 346. [2022-04-27 23:13:32,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:13:32,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 346 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 114 states have call successors, (114), 37 states have call predecessors, (114), 36 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2022-04-27 23:13:32,879 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 346 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 114 states have call successors, (114), 37 states have call predecessors, (114), 36 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2022-04-27 23:13:32,880 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 346 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 114 states have call successors, (114), 37 states have call predecessors, (114), 36 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2022-04-27 23:13:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:13:32,888 INFO L93 Difference]: Finished difference Result 360 states and 464 transitions. [2022-04-27 23:13:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 464 transitions. [2022-04-27 23:13:32,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:13:32,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:13:32,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 114 states have call successors, (114), 37 states have call predecessors, (114), 36 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) Second operand 360 states. [2022-04-27 23:13:32,893 INFO L87 Difference]: Start difference. First operand has 346 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 114 states have call successors, (114), 37 states have call predecessors, (114), 36 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) Second operand 360 states. [2022-04-27 23:13:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:13:32,901 INFO L93 Difference]: Finished difference Result 360 states and 464 transitions. [2022-04-27 23:13:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 464 transitions. [2022-04-27 23:13:32,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:13:32,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:13:32,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:13:32,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:13:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 114 states have call successors, (114), 37 states have call predecessors, (114), 36 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2022-04-27 23:13:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 454 transitions. [2022-04-27 23:13:32,911 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 454 transitions. Word has length 32 [2022-04-27 23:13:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:13:32,911 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 454 transitions. [2022-04-27 23:13:32,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:13:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 454 transitions. [2022-04-27 23:13:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 23:13:32,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:13:32,913 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:13:32,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 23:13:33,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 23:13:33,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:13:33,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:13:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1556551492, now seen corresponding path program 2 times [2022-04-27 23:13:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:13:33,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736647943] [2022-04-27 23:13:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:13:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:13:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:13:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:13:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:13:33,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {7109#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7093#(<= ~counter~0 0)} {7088#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:13:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:13:33,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {7088#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7088#true} is VALID [2022-04-27 23:13:33,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {7088#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {7088#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7088#true} {7093#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {7088#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7109#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:13:33,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {7109#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#(<= ~counter~0 0)} {7088#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {7093#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {7093#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,368 INFO L272 TraceCheckUtils]: 6: Hoare triple {7093#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {7088#true} is VALID [2022-04-27 23:13:33,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {7088#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7088#true} is VALID [2022-04-27 23:13:33,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {7088#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {7088#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7088#true} {7093#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {7093#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {7093#(<= ~counter~0 0)} is VALID [2022-04-27 23:13:33,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {7093#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7098#(<= ~counter~0 1)} is VALID [2022-04-27 23:13:33,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {7098#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7098#(<= ~counter~0 1)} is VALID [2022-04-27 23:13:33,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {7098#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7098#(<= ~counter~0 1)} is VALID [2022-04-27 23:13:33,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {7098#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7099#(<= ~counter~0 2)} is VALID [2022-04-27 23:13:33,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {7099#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7099#(<= ~counter~0 2)} is VALID [2022-04-27 23:13:33,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {7099#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7099#(<= ~counter~0 2)} is VALID [2022-04-27 23:13:33,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {7099#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7100#(<= ~counter~0 3)} is VALID [2022-04-27 23:13:33,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {7100#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7100#(<= ~counter~0 3)} is VALID [2022-04-27 23:13:33,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {7100#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7100#(<= ~counter~0 3)} is VALID [2022-04-27 23:13:33,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {7100#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7101#(<= ~counter~0 4)} is VALID [2022-04-27 23:13:33,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {7101#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7101#(<= ~counter~0 4)} is VALID [2022-04-27 23:13:33,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {7101#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7101#(<= ~counter~0 4)} is VALID [2022-04-27 23:13:33,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {7101#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7102#(<= ~counter~0 5)} is VALID [2022-04-27 23:13:33,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {7102#(<= ~counter~0 5)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7102#(<= ~counter~0 5)} is VALID [2022-04-27 23:13:33,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {7102#(<= ~counter~0 5)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7102#(<= ~counter~0 5)} is VALID [2022-04-27 23:13:33,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {7102#(<= ~counter~0 5)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7103#(<= ~counter~0 6)} is VALID [2022-04-27 23:13:33,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {7103#(<= ~counter~0 6)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7103#(<= ~counter~0 6)} is VALID [2022-04-27 23:13:33,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {7103#(<= ~counter~0 6)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7103#(<= ~counter~0 6)} is VALID [2022-04-27 23:13:33,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {7103#(<= ~counter~0 6)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7104#(<= ~counter~0 7)} is VALID [2022-04-27 23:13:33,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {7104#(<= ~counter~0 7)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7104#(<= ~counter~0 7)} is VALID [2022-04-27 23:13:33,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {7104#(<= ~counter~0 7)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7104#(<= ~counter~0 7)} is VALID [2022-04-27 23:13:33,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {7104#(<= ~counter~0 7)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7105#(<= ~counter~0 8)} is VALID [2022-04-27 23:13:33,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {7105#(<= ~counter~0 8)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7105#(<= ~counter~0 8)} is VALID [2022-04-27 23:13:33,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {7105#(<= ~counter~0 8)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7105#(<= ~counter~0 8)} is VALID [2022-04-27 23:13:33,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {7105#(<= ~counter~0 8)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7106#(<= ~counter~0 9)} is VALID [2022-04-27 23:13:33,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {7106#(<= ~counter~0 9)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7106#(<= ~counter~0 9)} is VALID [2022-04-27 23:13:33,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {7106#(<= ~counter~0 9)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7106#(<= ~counter~0 9)} is VALID [2022-04-27 23:13:33,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {7106#(<= ~counter~0 9)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7107#(<= ~counter~0 10)} is VALID [2022-04-27 23:13:33,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {7107#(<= ~counter~0 10)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7107#(<= ~counter~0 10)} is VALID [2022-04-27 23:13:33,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {7107#(<= ~counter~0 10)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7107#(<= ~counter~0 10)} is VALID [2022-04-27 23:13:33,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {7107#(<= ~counter~0 10)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7108#(<= |main_#t~post5| 10)} is VALID [2022-04-27 23:13:33,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {7108#(<= |main_#t~post5| 10)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7089#false} is VALID [2022-04-27 23:13:33,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {7089#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7089#false} is VALID [2022-04-27 23:13:33,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {7089#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7089#false} is VALID [2022-04-27 23:13:33,378 INFO L272 TraceCheckUtils]: 46: Hoare triple {7089#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {7089#false} is VALID [2022-04-27 23:13:33,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {7089#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7089#false} is VALID [2022-04-27 23:13:33,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {7089#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {7089#false} is VALID [2022-04-27 23:13:33,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {7089#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7089#false} is VALID [2022-04-27 23:13:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:13:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:13:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736647943] [2022-04-27 23:13:33,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736647943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:13:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266971721] [2022-04-27 23:13:33,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 23:13:33,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:13:33,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:13:33,380 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:13:33,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 23:13:33,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 23:13:33,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 23:13:33,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 23:13:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:13:33,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:13:33,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {7088#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {7088#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {7088#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7088#true} {7088#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {7088#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {7088#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {7088#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {7088#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {7088#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {7088#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7088#true} is VALID [2022-04-27 23:13:33,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7088#true} {7088#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {7088#true} is VALID [2022-04-27 23:13:33,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {7088#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {7088#true} is VALID [2022-04-27 23:13:33,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {7088#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 20) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {7088#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {7088#true} is VALID [2022-04-27 23:13:33,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {7088#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7239#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-27 23:13:33,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {7239#(<= (+ |main_#t~post5| 1) ~counter~0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 20)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7243#(<= 21 ~counter~0)} is VALID [2022-04-27 23:13:33,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {7243#(<= 21 ~counter~0)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7247#(<= 21 |main_#t~post6|)} is VALID [2022-04-27 23:13:33,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {7247#(<= 21 |main_#t~post6|)} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7089#false} is VALID [2022-04-27 23:13:33,600 INFO L272 TraceCheckUtils]: 46: Hoare triple {7089#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {7089#false} is VALID [2022-04-27 23:13:33,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {7089#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7089#false} is VALID [2022-04-27 23:13:33,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {7089#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {7089#false} is VALID [2022-04-27 23:13:33,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {7089#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7089#false} is VALID [2022-04-27 23:13:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-27 23:13:33,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:13:33,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266971721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:13:33,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:13:33,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-27 23:13:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091065615] [2022-04-27 23:13:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:13:33,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-27 23:13:33,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:13:33,601 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), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:13:33,614 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-27 23:13:33,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:13:33,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:13:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:13:33,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-27 23:13:33,615 INFO L87 Difference]: Start difference. First operand 346 states and 454 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:13:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:13:41,325 INFO L93 Difference]: Finished difference Result 389 states and 503 transitions. [2022-04-27 23:13:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:13:41,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-27 23:13:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:13:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:13:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-27 23:13:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:13:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-27 23:13:41,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-27 23:13:41,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:13:41,403 INFO L225 Difference]: With dead ends: 389 [2022-04-27 23:13:41,403 INFO L226 Difference]: Without dead ends: 347 [2022-04-27 23:13:41,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-27 23:13:41,404 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:13:41,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 174 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:13:41,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-04-27 23:13:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 211. [2022-04-27 23:13:41,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:13:41,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 211 states, 131 states have (on average 1.183206106870229) internal successors, (155), 135 states have internal predecessors, (155), 57 states have call successors, (57), 24 states have call predecessors, (57), 22 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 23:13:41,519 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 211 states, 131 states have (on average 1.183206106870229) internal successors, (155), 135 states have internal predecessors, (155), 57 states have call successors, (57), 24 states have call predecessors, (57), 22 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 23:13:41,519 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 211 states, 131 states have (on average 1.183206106870229) internal successors, (155), 135 states have internal predecessors, (155), 57 states have call successors, (57), 24 states have call predecessors, (57), 22 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 23:13:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:13:41,527 INFO L93 Difference]: Finished difference Result 347 states and 445 transitions. [2022-04-27 23:13:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 445 transitions. [2022-04-27 23:13:41,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:13:41,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:13:41,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 131 states have (on average 1.183206106870229) internal successors, (155), 135 states have internal predecessors, (155), 57 states have call successors, (57), 24 states have call predecessors, (57), 22 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) Second operand 347 states. [2022-04-27 23:13:41,529 INFO L87 Difference]: Start difference. First operand has 211 states, 131 states have (on average 1.183206106870229) internal successors, (155), 135 states have internal predecessors, (155), 57 states have call successors, (57), 24 states have call predecessors, (57), 22 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) Second operand 347 states. [2022-04-27 23:13:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:13:41,536 INFO L93 Difference]: Finished difference Result 347 states and 445 transitions. [2022-04-27 23:13:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 445 transitions. [2022-04-27 23:13:41,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:13:41,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:13:41,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:13:41,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:13:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 131 states have (on average 1.183206106870229) internal successors, (155), 135 states have internal predecessors, (155), 57 states have call successors, (57), 24 states have call predecessors, (57), 22 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 23:13:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 265 transitions. [2022-04-27 23:13:41,541 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 265 transitions. Word has length 50 [2022-04-27 23:13:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:13:41,541 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 265 transitions. [2022-04-27 23:13:41,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:13:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 265 transitions. [2022-04-27 23:13:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 23:13:41,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:13:41,543 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:13:41,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 23:13:41,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:13:41,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:13:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:13:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash -926681017, now seen corresponding path program 1 times [2022-04-27 23:13:41,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:13:41,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187065759] [2022-04-27 23:13:41,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:13:41,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:13:41,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:13:41,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106682793] [2022-04-27 23:13:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:13:41,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:13:41,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:13:41,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:13:41,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process