/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/hard-u_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 00:20:37,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 00:20:37,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 00:20:37,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 00:20:37,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 00:20:37,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 00:20:37,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 00:20:37,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 00:20:37,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 00:20:37,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 00:20:37,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 00:20:37,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 00:20:37,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 00:20:37,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 00:20:37,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 00:20:37,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 00:20:37,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 00:20:37,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 00:20:37,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 00:20:37,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 00:20:37,453 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 00:20:37,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 00:20:37,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 00:20:37,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 00:20:37,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 00:20:37,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 00:20:37,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 00:20:37,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 00:20:37,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 00:20:37,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 00:20:37,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 00:20:37,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 00:20:37,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 00:20:37,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 00:20:37,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 00:20:37,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 00:20:37,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 00:20:37,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 00:20:37,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 00:20:37,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 00:20:37,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 00:20:37,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 00:20:37,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 00:20:37,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 00:20:37,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 00:20:37,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 00:20:37,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 00:20:37,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 00:20:37,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 00:20:37,508 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 00:20:37,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 00:20:37,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 00:20:37,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 00:20:37,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 00:20:37,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 00:20:37,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 00:20:37,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 00:20:37,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 00:20:37,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 00:20:37,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 00:20:37,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 00:20:37,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 00:20:37,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:20:37,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 00:20:37,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 00:20:37,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 00:20:37,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 00:20:37,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 00:20:37,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 00:20:37,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 00:20:37,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 00:20:37,513 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 00:20:37,513 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 00:20:37,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 00:20:37,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 00:20:37,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 00:20:37,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 00:20:37,772 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 00:20:37,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-04-28 00:20:37,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fee8bc46/f8fe3fd756df407c84becc298092c71a/FLAG4bd9b95ec [2022-04-28 00:20:38,207 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 00:20:38,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-04-28 00:20:38,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fee8bc46/f8fe3fd756df407c84becc298092c71a/FLAG4bd9b95ec [2022-04-28 00:20:38,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fee8bc46/f8fe3fd756df407c84becc298092c71a [2022-04-28 00:20:38,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 00:20:38,224 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 00:20:38,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 00:20:38,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 00:20:38,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 00:20:38,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692e4061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38, skipping insertion in model container [2022-04-28 00:20:38,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 00:20:38,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 00:20:38,447 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/hard-u_unwindbound1.c[537,550] [2022-04-28 00:20:38,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:20:38,498 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 00:20:38,512 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/hard-u_unwindbound1.c[537,550] [2022-04-28 00:20:38,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:20:38,543 INFO L208 MainTranslator]: Completed translation [2022-04-28 00:20:38,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38 WrapperNode [2022-04-28 00:20:38,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 00:20:38,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 00:20:38,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 00:20:38,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 00:20:38,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 00:20:38,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 00:20:38,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 00:20:38,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 00:20:38,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:20:38,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:20:38,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 00:20:38,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 00:20:38,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 00:20:38,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 00:20:38,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 00:20:38,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 00:20:38,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 00:20:38,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 00:20:38,647 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 00:20:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 00:20:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 00:20:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 00:20:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 00:20:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 00:20:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 00:20:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 00:20:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 00:20:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 00:20:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 00:20:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 00:20:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 00:20:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 00:20:38,704 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 00:20:38,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 00:20:38,834 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 00:20:38,839 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 00:20:38,839 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 00:20:38,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:20:38 BoogieIcfgContainer [2022-04-28 00:20:38,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 00:20:38,841 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 00:20:38,841 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 00:20:38,842 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 00:20:38,844 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:20:38" (1/1) ... [2022-04-28 00:20:38,846 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 00:20:38,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:20:38 BasicIcfg [2022-04-28 00:20:38,891 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 00:20:38,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 00:20:38,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 00:20:38,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 00:20:38,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:20:38" (1/4) ... [2022-04-28 00:20:38,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f4cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:20:38, skipping insertion in model container [2022-04-28 00:20:38,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:38" (2/4) ... [2022-04-28 00:20:38,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f4cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:20:38, skipping insertion in model container [2022-04-28 00:20:38,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:20:38" (3/4) ... [2022-04-28 00:20:38,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f4cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:20:38, skipping insertion in model container [2022-04-28 00:20:38,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:20:38" (4/4) ... [2022-04-28 00:20:38,898 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound1.cqvasr [2022-04-28 00:20:38,921 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 00:20:38,921 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 00:20:38,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 00:20:38,962 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@1605030f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d52a1be [2022-04-28 00:20:38,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 00:20:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 00:20:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 00:20:38,975 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:20:38,975 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-28 00:20:38,976 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:20:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:20:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 79654685, now seen corresponding path program 1 times [2022-04-28 00:20:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:20:38,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715202562] [2022-04-28 00:20:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:38,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:20:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:20:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:39,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {40#true} is VALID [2022-04-28 00:20:39,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:20:39,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:20:39,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 00:20:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:39,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: 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] {40#true} is VALID [2022-04-28 00:20:39,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:20:39,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:20:39,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-28 00:20:39,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:20:39,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {40#true} is VALID [2022-04-28 00:20:39,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:20:39,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:20:39,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:20:39,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {40#true} is VALID [2022-04-28 00:20:39,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-28 00:20:39,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: 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] {40#true} is VALID [2022-04-28 00:20:39,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:20:39,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:20:39,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-28 00:20:39,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {41#false} is VALID [2022-04-28 00:20:39,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} [108] L35-3-->L53-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:20:39,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} [112] L53-2-->L45-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:20:39,251 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {41#false} is VALID [2022-04-28 00:20:39,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [122] __VERIFIER_assertENTRY-->L15: 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] {41#false} is VALID [2022-04-28 00:20:39,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} [126] L15-->L16: 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[] {41#false} is VALID [2022-04-28 00:20:39,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:20:39,252 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-28 00:20:39,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:20:39,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715202562] [2022-04-28 00:20:39,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715202562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:20:39,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:20:39,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 00:20:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828934907] [2022-04-28 00:20:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:20:39,261 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-28 00:20:39,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:20:39,265 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-28 00:20:39,298 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-28 00:20:39,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 00:20:39,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:20:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 00:20:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 00:20:39,323 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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-28 00:20:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:39,542 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-28 00:20:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 00:20:39,543 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-28 00:20:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:20:39,545 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-28 00:20:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 00:20:39,560 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-28 00:20:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 00:20:39,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 00:20:39,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:20:39,679 INFO L225 Difference]: With dead ends: 66 [2022-04-28 00:20:39,679 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 00:20:39,682 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-28 00:20:39,684 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:20:39,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:20:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 00:20:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 00:20:39,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:20:39,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:39,711 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:39,711 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:39,715 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 00:20:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 00:20:39,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:39,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:39,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 00:20:39,717 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 00:20:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:39,720 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 00:20:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 00:20:39,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:39,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:39,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:20:39,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:20:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 00:20:39,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-28 00:20:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:20:39,726 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 00:20:39,726 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-28 00:20:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 00:20:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 00:20:39,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:20:39,727 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-28 00:20:39,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 00:20:39,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:20:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:20:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -85369733, now seen corresponding path program 1 times [2022-04-28 00:20:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:20:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682316630] [2022-04-28 00:20:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:20:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:20:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:39,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {256#true} is VALID [2022-04-28 00:20:39,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:20:39,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:20:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 00:20:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:39,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} [107] assume_abort_if_notENTRY-->L12: 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] {256#true} is VALID [2022-04-28 00:20:39,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [111] L12-->L12-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[] {256#true} is VALID [2022-04-28 00:20:39,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:20:39,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {256#true} is VALID [2022-04-28 00:20:39,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:20:39,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {256#true} is VALID [2022-04-28 00:20:39,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:20:39,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:20:39,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:20:39,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {256#true} is VALID [2022-04-28 00:20:39,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {256#true} is VALID [2022-04-28 00:20:39,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} [107] assume_abort_if_notENTRY-->L12: 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] {256#true} is VALID [2022-04-28 00:20:39,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} [111] L12-->L12-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[] {256#true} is VALID [2022-04-28 00:20:39,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:20:39,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {256#true} is VALID [2022-04-28 00:20:39,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {265#(= main_~q~0 0)} is VALID [2022-04-28 00:20:39,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {265#(= main_~q~0 0)} is VALID [2022-04-28 00:20:39,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {265#(= main_~q~0 0)} is VALID [2022-04-28 00:20:39,859 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 00:20:39,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: 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] {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 00:20:39,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: 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[] {257#false} is VALID [2022-04-28 00:20:39,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-28 00:20:39,861 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-28 00:20:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:20:39,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682316630] [2022-04-28 00:20:39,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682316630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:20:39,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:20:39,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:20:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374996572] [2022-04-28 00:20:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:20:39,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 00:20:39,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:20:39,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:20:39,892 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-28 00:20:39,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:20:39,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:20:39,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:20:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:20:39,898 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:20:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:40,306 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 00:20:40,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 00:20:40,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 00:20:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:20:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:20:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:20:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:20:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:20:40,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 00:20:40,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:20:40,383 INFO L225 Difference]: With dead ends: 47 [2022-04-28 00:20:40,383 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 00:20:40,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 00:20:40,385 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:20:40,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:20:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 00:20:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-28 00:20:40,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:20:40,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,404 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,404 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:40,408 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 00:20:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 00:20:40,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:40,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:40,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 00:20:40,411 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 00:20:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:40,414 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 00:20:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 00:20:40,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:40,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:40,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:20:40,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:20:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 00:20:40,418 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-28 00:20:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:20:40,419 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 00:20:40,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:20:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 00:20:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 00:20:40,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:20:40,420 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-28 00:20:40,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 00:20:40,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:20:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:20:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1527809342, now seen corresponding path program 1 times [2022-04-28 00:20:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:20:40,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61211474] [2022-04-28 00:20:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:20:40,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:20:40,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215892090] [2022-04-28 00:20:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:40,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:40,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:20:40,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:20:40,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 00:20:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:40,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 00:20:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:40,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:20:40,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-28 00:20:40,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: 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] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} [111] L12-->L12-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[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:20:40,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {531#(<= |main_#t~post6| 0)} is VALID [2022-04-28 00:20:40,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {490#false} is VALID [2022-04-28 00:20:40,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {490#false} is VALID [2022-04-28 00:20:40,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {490#false} is VALID [2022-04-28 00:20:40,719 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {490#false} is VALID [2022-04-28 00:20:40,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} [122] __VERIFIER_assertENTRY-->L15: 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] {490#false} is VALID [2022-04-28 00:20:40,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} [126] L15-->L16: 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[] {490#false} is VALID [2022-04-28 00:20:40,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-28 00:20:40,720 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-28 00:20:40,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:20:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:20:40,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61211474] [2022-04-28 00:20:40,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:20:40,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215892090] [2022-04-28 00:20:40,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215892090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:20:40,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:20:40,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 00:20:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135237809] [2022-04-28 00:20:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:20:40,722 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-28 00:20:40,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:20:40,722 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-28 00:20:40,740 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-28 00:20:40,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 00:20:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:20:40,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 00:20:40,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 00:20:40,742 INFO L87 Difference]: Start difference. First operand 36 states and 45 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-28 00:20:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:40,864 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-28 00:20:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 00:20:40,865 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-28 00:20:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:20:40,865 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-28 00:20:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 00:20:40,868 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-28 00:20:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 00:20:40,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-28 00:20:40,925 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-28 00:20:40,927 INFO L225 Difference]: With dead ends: 52 [2022-04-28 00:20:40,927 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 00:20:40,927 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-28 00:20:40,928 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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-28 00:20:40,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:20:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 00:20:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 00:20:40,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:20:40,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,937 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,937 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:40,939 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 00:20:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 00:20:40,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:40,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:40,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 00:20:40,941 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 00:20:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:40,943 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 00:20:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 00:20:40,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:40,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:40,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:20:40,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:20:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-28 00:20:40,945 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-28 00:20:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:20:40,946 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-28 00:20:40,946 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-28 00:20:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 00:20:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 00:20:40,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:20:40,946 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-28 00:20:40,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 00:20:41,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:41,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:20:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:20:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2128444854, now seen corresponding path program 1 times [2022-04-28 00:20:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:20:41,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652028489] [2022-04-28 00:20:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:41,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:20:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:41,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:20:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:41,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {757#true} is VALID [2022-04-28 00:20:41,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 00:20:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:41,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} [107] assume_abort_if_notENTRY-->L12: 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] {757#true} is VALID [2022-04-28 00:20:41,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} [111] L12-->L12-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[] {757#true} is VALID [2022-04-28 00:20:41,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {757#true} is VALID [2022-04-28 00:20:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 00:20:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:41,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} [122] __VERIFIER_assertENTRY-->L15: 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] {757#true} is VALID [2022-04-28 00:20:41,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} [127] L15-->L15-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[] {757#true} is VALID [2022-04-28 00:20:41,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:20:41,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:20:41,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {757#true} is VALID [2022-04-28 00:20:41,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {757#true} is VALID [2022-04-28 00:20:41,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {757#true} is VALID [2022-04-28 00:20:41,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} [107] assume_abort_if_notENTRY-->L12: 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] {757#true} is VALID [2022-04-28 00:20:41,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} [111] L12-->L12-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[] {757#true} is VALID [2022-04-28 00:20:41,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {757#true} is VALID [2022-04-28 00:20:41,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:20:41,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:20:41,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:20:41,284 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {757#true} is VALID [2022-04-28 00:20:41,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} [122] __VERIFIER_assertENTRY-->L15: 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] {757#true} is VALID [2022-04-28 00:20:41,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} [127] L15-->L15-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[] {757#true} is VALID [2022-04-28 00:20:41,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:20:41,285 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:20:41,286 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 00:20:41,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: 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] {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 00:20:41,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: 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[] {758#false} is VALID [2022-04-28 00:20:41,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {758#false} is VALID [2022-04-28 00:20:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:20:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:20:41,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652028489] [2022-04-28 00:20:41,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652028489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:20:41,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:20:41,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:20:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573896223] [2022-04-28 00:20:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:20:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 00:20:41,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:20:41,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:20:41,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:20:41,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:20:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:20:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:20:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:20:41,307 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:20:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:41,683 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 00:20:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 00:20:41,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 00:20:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:20:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:20:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:20:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:20:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:20:41,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 00:20:41,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:20:41,750 INFO L225 Difference]: With dead ends: 52 [2022-04-28 00:20:41,750 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 00:20:41,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 00:20:41,751 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 00:20:41,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 00:20:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 00:20:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-28 00:20:41,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:20:41,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:41,760 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:41,761 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:41,763 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 00:20:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 00:20:41,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:41,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:41,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 00:20:41,764 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 00:20:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:41,767 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 00:20:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 00:20:41,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:41,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:41,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:20:41,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:20:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:20:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 00:20:41,770 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-28 00:20:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:20:41,770 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 00:20:41,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:20:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 00:20:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 00:20:41,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:20:41,771 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] [2022-04-28 00:20:41,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 00:20:41,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:20:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:20:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 135546551, now seen corresponding path program 1 times [2022-04-28 00:20:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:20:41,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591008021] [2022-04-28 00:20:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:20:41,787 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:20:41,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355353777] [2022-04-28 00:20:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:41,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:41,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:20:41,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:20:41,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 00:20:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:41,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:20:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:41,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:20:42,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:20:42,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {1018#true} is VALID [2022-04-28 00:20:42,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:20:42,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:20:42,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:20:42,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1018#true} is VALID [2022-04-28 00:20:42,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1018#true} is VALID [2022-04-28 00:20:42,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} [107] assume_abort_if_notENTRY-->L12: 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] {1018#true} is VALID [2022-04-28 00:20:42,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} [111] L12-->L12-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[] {1018#true} is VALID [2022-04-28 00:20:42,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:20:42,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1018#true} is VALID [2022-04-28 00:20:42,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:20:42,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:20:42,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:20:42,030 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1018#true} is VALID [2022-04-28 00:20:42,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1018#true} is VALID [2022-04-28 00:20:42,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} [127] L15-->L15-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[] {1018#true} is VALID [2022-04-28 00:20:42,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:20:42,033 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:20:42,034 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1018#true} is VALID [2022-04-28 00:20:42,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1018#true} is VALID [2022-04-28 00:20:42,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} [127] L15-->L15-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[] {1018#true} is VALID [2022-04-28 00:20:42,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:20:42,036 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:20:42,038 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:20:42,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: 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] {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:20:42,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: 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[] {1019#false} is VALID [2022-04-28 00:20:42,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#false} is VALID [2022-04-28 00:20:42,043 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-28 00:20:42,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:20:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:20:42,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591008021] [2022-04-28 00:20:42,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:20:42,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355353777] [2022-04-28 00:20:42,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355353777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:20:42,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:20:42,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:20:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676690496] [2022-04-28 00:20:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:20:42,045 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), 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 28 [2022-04-28 00:20:42,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:20:42,045 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), 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-28 00:20:42,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:20:42,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:20:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:20:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:20:42,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:20:42,080 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 00:20:44,258 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-28 00:20:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:44,443 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 00:20:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:20:44,443 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), 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 28 [2022-04-28 00:20:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:20:44,444 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), 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-28 00:20:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 00:20:44,446 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), 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-28 00:20:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 00:20:44,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-28 00:20:44,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:20:44,524 INFO L225 Difference]: With dead ends: 59 [2022-04-28 00:20:44,524 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 00:20:44,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:20:44,525 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:20:44,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 00:20:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 00:20:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 00:20:44,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:20:44,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:20:44,542 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:20:44,543 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:20:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:44,545 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 00:20:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 00:20:44,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:44,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:44,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 00:20:44,546 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 00:20:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:44,549 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 00:20:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 00:20:44,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:44,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:44,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:20:44,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:20:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:20:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-28 00:20:44,552 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-28 00:20:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:20:44,552 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-28 00:20:44,553 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), 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-28 00:20:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 00:20:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 00:20:44,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:20:44,553 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:20:44,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 00:20:44,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:44,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:20:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:20:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1016025214, now seen corresponding path program 1 times [2022-04-28 00:20:44,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:20:44,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971854264] [2022-04-28 00:20:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:20:44,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:20:44,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951194603] [2022-04-28 00:20:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:20:44,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:20:44,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 00:20:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:44,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 00:20:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:20:44,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:20:45,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {1386#true} is VALID [2022-04-28 00:20:45,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {1386#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {1386#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1386#true} is VALID [2022-04-28 00:20:45,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {1386#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1386#true} is VALID [2022-04-28 00:20:45,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {1386#true} [107] assume_abort_if_notENTRY-->L12: 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] {1386#true} is VALID [2022-04-28 00:20:45,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1386#true} [111] L12-->L12-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[] {1386#true} is VALID [2022-04-28 00:20:45,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {1386#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1386#true} {1386#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1386#true} is VALID [2022-04-28 00:20:45,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {1386#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,593 INFO L272 TraceCheckUtils]: 14: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1386#true} is VALID [2022-04-28 00:20:45,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1386#true} is VALID [2022-04-28 00:20:45,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#true} [127] L15-->L15-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[] {1386#true} is VALID [2022-04-28 00:20:45,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,594 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1386#true} {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,594 INFO L272 TraceCheckUtils]: 19: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1386#true} is VALID [2022-04-28 00:20:45,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {1386#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1386#true} is VALID [2022-04-28 00:20:45,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {1386#true} [127] L15-->L15-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[] {1386#true} is VALID [2022-04-28 00:20:45,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {1386#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,595 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1386#true} {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,595 INFO L272 TraceCheckUtils]: 24: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1386#true} is VALID [2022-04-28 00:20:45,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {1386#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1386#true} is VALID [2022-04-28 00:20:45,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {1386#true} [127] L15-->L15-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[] {1386#true} is VALID [2022-04-28 00:20:45,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {1386#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:20:45,597 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1386#true} {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 00:20:45,599 INFO L272 TraceCheckUtils]: 32: Hoare triple {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:20:45,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {1489#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: 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] {1493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:20:45,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {1493#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: 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[] {1387#false} is VALID [2022-04-28 00:20:45,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1387#false} is VALID [2022-04-28 00:20:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 00:20:45,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:20:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:20:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971854264] [2022-04-28 00:20:45,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:20:45,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951194603] [2022-04-28 00:20:45,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951194603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:20:45,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:20:45,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:20:45,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779649521] [2022-04-28 00:20:45,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:20:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 00:20:45,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:20:45,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:20:45,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:20:45,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:20:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:20:45,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:20:45,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:20:45,638 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:20:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:46,117 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-04-28 00:20:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 00:20:46,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 00:20:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:20:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:20:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 00:20:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:20:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 00:20:46,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-28 00:20:46,211 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-28 00:20:46,213 INFO L225 Difference]: With dead ends: 77 [2022-04-28 00:20:46,213 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 00:20:46,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 00:20:46,214 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 00:20:46,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 00:20:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 00:20:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2022-04-28 00:20:46,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:20:46,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:20:46,231 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:20:46,231 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:20:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:46,234 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-28 00:20:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-04-28 00:20:46,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:46,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:46,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 74 states. [2022-04-28 00:20:46,236 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 74 states. [2022-04-28 00:20:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:20:46,239 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-28 00:20:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-04-28 00:20:46,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:20:46,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:20:46,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:20:46,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:20:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:20:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-04-28 00:20:46,243 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 36 [2022-04-28 00:20:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:20:46,243 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-04-28 00:20:46,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:20:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-28 00:20:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 00:20:46,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:20:46,244 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-04-28 00:20:46,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 00:20:46,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:46,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:20:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:20:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash 66401941, now seen corresponding path program 1 times [2022-04-28 00:20:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:20:46,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446270413] [2022-04-28 00:20:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:20:46,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:20:46,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450318616] [2022-04-28 00:20:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:20:46,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:46,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:20:46,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:20:46,488 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-28 00:20:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:20:46,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 00:20:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:20:46,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 00:20:46,577 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 00:20:46,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 00:20:46,604 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-28 00:20:46,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:20:46,781 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:20:46,783 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 00:20:46,811 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 00:20:46,811 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 00:20:46,811 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 00:20:46,811 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 00:20:46,811 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 00:20:46,811 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 00:20:46,811 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:20:46,812 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 00:20:46,813 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 00:20:46,814 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 00:20:46,814 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-28 00:20:46,814 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-28 00:20:46,814 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 00:20:46,814 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 00:20:46,814 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-28 00:20:46,814 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 00:20:46,814 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 00:20:46,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:20:46 BasicIcfg [2022-04-28 00:20:46,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 00:20:46,816 INFO L158 Benchmark]: Toolchain (without parser) took 8591.33ms. Allocated memory was 179.3MB in the beginning and 244.3MB in the end (delta: 65.0MB). Free memory was 131.2MB in the beginning and 113.2MB in the end (delta: 18.1MB). Peak memory consumption was 84.1MB. Max. memory is 8.0GB. [2022-04-28 00:20:46,816 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 00:20:46,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.63ms. Allocated memory is still 179.3MB. Free memory was 131.0MB in the beginning and 158.4MB in the end (delta: -27.3MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-04-28 00:20:46,816 INFO L158 Benchmark]: Boogie Preprocessor took 40.51ms. Allocated memory is still 179.3MB. Free memory was 158.4MB in the beginning and 156.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 00:20:46,816 INFO L158 Benchmark]: RCFGBuilder took 254.68ms. Allocated memory is still 179.3MB. Free memory was 156.3MB in the beginning and 144.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 00:20:46,817 INFO L158 Benchmark]: IcfgTransformer took 50.35ms. Allocated memory is still 179.3MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 00:20:46,817 INFO L158 Benchmark]: TraceAbstraction took 7921.98ms. Allocated memory was 179.3MB in the beginning and 244.3MB in the end (delta: 65.0MB). Free memory was 141.6MB in the beginning and 113.2MB in the end (delta: 28.4MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. [2022-04-28 00:20:46,818 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.63ms. Allocated memory is still 179.3MB. Free memory was 131.0MB in the beginning and 158.4MB in the end (delta: -27.3MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.51ms. Allocated memory is still 179.3MB. Free memory was 158.4MB in the beginning and 156.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 254.68ms. Allocated memory is still 179.3MB. Free memory was 156.3MB in the beginning and 144.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 50.35ms. Allocated memory is still 179.3MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7921.98ms. Allocated memory was 179.3MB in the beginning and 244.3MB in the end (delta: 65.0MB). Free memory was 141.6MB in the beginning and 113.2MB in the end (delta: 28.4MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] unsigned int A, B; [L25] unsigned int r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L12] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(B >= 1) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=0] [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=0, d=4294967297, p=1, q=0, r=4294967297] [L35] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, counter++=0, d=4294967297, p=1, q=0, r=4294967297] [L35] COND TRUE counter++<1 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=8589934594, p=2, q=0, r=4294967297] [L35] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=2, counter++=1, d=8589934594, p=2, q=0, r=4294967297] [L35] COND FALSE !(counter++<1) [L45] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=3, counter++=2, d=8589934594, p=2, q=0, r=4294967297] [L45] COND FALSE !(counter++<1) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=3, d=8589934594, p=2, q=0, r=4294967297] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 244 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 4 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 00:20:46,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...